Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22TAILLE GRAPHE%22)

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 37422

  • Page / 1497
Export

Selection :

  • and

GRAPHS WITH ISOMORPHIC SUBGRAPHSHEYDAR RADJAVI; ROSENTHAL P.1972; J. LONDON MATH. SOC.; G.B.; DA. 1972; VOL. 6; NO 1; PP. 70-72; BIBL. 3 REF.Serial Issue

THREE REMARKABLE GRAPHSBIGGS N.1973; CANAD. J. MATH.; CANADA; DA. 1973; VOL. 25; NO 2; PP. 397-411; BIBL. 21 REF.Serial Issue

IL-22 : A critical mediator in mucosal host defenseAUJLA, S. J; KOLLS, J. K.Journal of molecular medicine (Berlin. Print). 2009, Vol 87, Num 5, pp 451-454, issn 0946-2716, 4 p.Article

THE EXPECTED NUMBER OF COMPONENTS IN RANDOM LINEAR GRAPHS.LING RF.1973; ANN. PROBAB.; U.S.A.; DA. 1973; VOL. 1; NO 5; PP. 876-881; BIBL. 9 REF.Article

GRAPH STRUCTURESPFALTZ JL.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 411-422; BIBL. 5 REF.Serial Issue

AUTOMORPHISMEN VON X-SUMMEN VON GRAPHEN = AUTOMORPHISMES DES SOMMES X DES GRAPHESDORFLER W.1972; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1972; VOL. 22; NO 4; PP. 581-589; BIBL. 9 REF.Serial Issue

ON THE GIRTH AND GENUS OF A GRAPHNORDHAUS EA.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 207-214; BIBL. 1 P.Serial Issue

AN EXTENSION OF KASTELEYN'S METHOD OF ENUMERATING THE 1-FACTORS OF PLANAR GRAPHS.LITTLE CHC.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 403; PP. 63-72; BIBL. 1 REF.; (COMB. MATH. PROC. 2ND AUST. CONF.; MELBOURNE; 1973)Conference Paper

ON ARBITRARILY TRACEABLE GRAPHSDIRAC G.1973; MATH. SCAND.; DANEM.; DA. 1973; VOL. 31; NO 2; PP. 319-378; BIBL. 8 REF.Serial Issue

REGULAR N-VALENT N-CONNECTED NONHAMILTONIAN NON-N-EDGE-COLORABLE GRAPHSMEREDITH GHJ.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 55-60; BIBL. 3 REF.Serial Issue

DECOMPOSITION OF KN INTO CIRCUITS OF ODD LENGTH.SOTTEAU D.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 2; PP. 185-191; BIBL. 13 REF.Article

ON THE RECONSTRUCTION OF COUNTABLE FORESTSHARARY F; SCHWENK AJ; SCOTT RL et al.1972; PUBL. INST. MATH.; YOUGOSL.; DA. 1972; VOL. 13; PP. 39-42; BIBL. 9 REF.Serial Issue

UPPER BOUNDS ON THE ORDER OF A CLIQUE OF A GRAPHAMIN AT; HAKIMI SL.1972; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1972; VOL. 22; NO 4; PP. 569-573; BIBL. 9 REF.Serial Issue

ON THE MAXIMAL ORDER OF CYCLICITY OF ANTISYMMETRIC DIRECTED GRAPHS.KOTZIG A.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 1; PP. 17-25; BIBL. 3 REF.Article

AN APPLICATION OF THE SOLUTION OF KIRKMAN'S SCHOOLGIRL PROBLEM: THE DECOMPOSITION OF THE SYMMETRIC ORIENTED COMPLETE GRAPH INTO 3-CIRCUITS.BERMOND JC.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 4; PP. 301-304; BIBL. 2 REF.Article

SUR LE NOMBRE DE SAUTS D'UNE FORETCHEIN M; MARTIN P.1972; C. R. ACAD. SCI., A; FR.; DA. 1972; VOL. 275; NO 3; PP. 159-161; BIBL. 3 REF.Serial Issue

CENTRALITE ET COMPACITE D'UN GRAPHEPARLEBAS P.1972; MATH. SIC. HUM.; FR.; DA. 1972; NO 39; PP. 5-26; BIBL. 11 REF.Serial Issue

VERTEX COVERINGS BY MONOCHROMATIC PATHS AND CYCLESGYARFAS A.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 1; PP. 131-135; BIBL. 6 REF.Article

WAGNER'S THEOREM FOR TORUS GRAPHSDEWDNEY AK.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 2; PP. 139-149; BIBL. 3 REF.Serial Issue

HYPOHAMILTONIAN AND HYPOCEABLE GRAPHS.THOMASSEN C.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 1; PP. 91-96; BIBL. 8 REF.Article

INDEPENDENCE NUMBERS OF PRODUCT GRAPHS.SONNEMANN E; KRAFFT O.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 2; PP. 133-142; BIBL. 8 REF.Article

VERTICES MISSED BY LONGEST PATHS OR CIRCUITS.GRUENBAUM B.1974; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 31-38; BIBL. 25 REF.Article

A NOTE ON FINDING ALL MAXIMUM CATS IN A GRAPH.NIEMINEN J.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 4; PP. 215-217; ABS. ALLEM. RUSSE; BIBL. 4 REF.Article

STRUCTURE OF VERTEX-TRANSITIVE GRAPHS.GREEN AC.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 1; PP. 1-11; BIBL. 8 REF.Article

A SURVEY OF THE RECONSTRUCTION CONJECTURE.HARARY F.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 18-28; BIBL. 2 P. 1/2; (GRAPHS AND COMB. PROC. CAP. CONF. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

  • Page / 1497