Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("BONDY JA")

Results 1 to 18 of 18

  • Page / 1
Export

Selection :

  • and

THE "GRAPH THEORY" OF THE GREEK ALPHABETBONDY JA.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 44-54; BIBL. 3 REF.Serial Issue

BALANCED COLOURINGS AND THE FOUR COLOUR CONJECTUREBONDY JA.1972; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1972; VOL. 33; NO 2; PP. 241-244; BIBL. 4 REF.Serial Issue

EXTREMAL GRAPHS WITH PRESCRIBED COVERING NUMBER.BONDY JA.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 51-52; BIBL. 3 REF.Article

REFLECTIONS ON THE LEGITIMATE DECK PROBLEMBONDY JA.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 1-12; BIBL. 15 REF.Conference Paper

A REMARK ON TWO SUFFICIENT CONDITIONS FOR HAMILTON CYCLES.BONDY JA.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 2; PP. 191-193; BIBL. 5 REF.Article

LARGE DENSE NEIGHBOURHOODS AND TURAN'S THEOREMBONDY JA.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 1; PP. 109-111; BIBL. 5 REF.Article

LONGEST CYCLES IN 3-CONNECTED 3-REGULAR GRAPHSBONDY JA; SIMONOVITS M.1980; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1980; VOL. 32; NO 4; PP. 987-992; BIBL. 9 REF.Article

RELATIVE LENGTHS OF PATHS AND CYCLES IN 3-CONNECTED GRAPHSBONDY JA; LOCKE SC.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 2; PP. 111-122; BIBL. 7 REF.Article

COUNTEREXAMPLES TO THEOREMS OF MENGER TYPE FOR THE DIAMETERBONDY JA; HELL P.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 2; PP. 217-220; BIBL. 7 REF.Article

RELATIVE LENGTHS OF PATHS AND CYCLES IN K-CONNECTED GRAPHSBONDY JA; LOCKE SC.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 8; PP. 253-259; BIBL. 6 REF.Conference Paper

RECONSTRUCTION BY ENUMERATION: SOME APPLICATIONS OF A COUNTING THEOREM TO THE GRAPH RECONSTRUCTION PROBLEMBONDY JA; HEMMINGER RL.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 51-55; ABS. FRE; BIBL. 20 REF.Conference Paper

A SHORT PROOF OF MEYNIEL'S THEOREM.BONDY JA; THOMASSEN C.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 19; NO 2; PP. 195-197; BIBL. 3 REF.Article

PANCYCLIC GRAPHS II.BONDY JA; INGLETON AW.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 41-46; BIBL. 5 REF.Article

EDGE-DISJOINT HAMILTON CYCLES IN 4-REGULAR PLANAR GRAPHSBONDY JA; HAEGGKVIST R.1981; AEQU. MATH.; ISSN 0001-9054; CHE; DA. 1981; VOL. 22; NO 1; PP. 42-45; BIBL. 8 REF.Article

LONGEST CYCLES IN 2-CONNECTED GRAPHS WITH PRESCRIBED MAXIMUM DEGREEBONDY JA; ENTRINGER RC.1980; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1980; VOL. 32; NO 6; PP. 1325-1332; BIBL. 16 REF.Article

A METHOD IN GRAPH THEORY.BONDY JA; CHVATAL V.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 2; PP. 111-135; BIBL. 16 REF.Article

RAMSEY NUMBERS FOR CYCLES IN GRAPHSBONDY JA; ERDOS P.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 46-54; BIBL. 7 REF.Serial Issue

A NEW PROOF OF A THEOREM OF DIRACBONDY JA; BEN ARROYO HARTMAN I; LOCKE SC et al.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 131-136; BIBL. 6 REF.Conference Paper

  • Page / 1