A NOTE ON 1-FACTORS IN GRAPHSCHARTRAND G; NEBESKY L.1979; PERIOD. MATH. HUNGAR.; HUN; DA. 1979; VOL. 10; NO 1; PP. 41-46; BIBL. 7 REF.Article

ON REGULAR BIPARTITE-PRESERVING SUPERGRAPHS.CHARTRAND G WALL CE.1975; AEQUATIONES MATH.; SUISSE; DA. 1975; VOL. 13; NO 1-2; PP. 97-101; BIBL. 3 REF.Article

A NOTE ON LOCALLY CONNECTED AND HAMILTONIAN-CONNECTED GRAPHSCHARTRAND G; GOULD RJ; POLIMENI AD et al.1979; ISRAEL J. MATH.; ISR; DA. 1979; VOL. 33; NO 1; PP. 5-8; BIBL. 3 REF.Article

DEGREE SETS FOR DISGRAPHS.CHARTRAND G; LESNIAK L; ROBERTS J et al.1976; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1976; VOL. 7; NO 1; PP. 77-85; BIBL. 1 REF.Article

ON RAMSEY NUMBERS OF FORESTS VERSUS NEARLY COMPLETE GRAPHSCHARTRAND G; GOULD RJ; POLIMENI AD et al.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 2; PP. 233-239; BIBL. 6 REF.Article

ON HOMOGENEOUSLY TRACEABLE NONHAMILTONIAN GRAPHSCHARTRAND G; GOULD RJ; KAPOOR SF et al.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 130-135; BIBL. 1 REF.Conference Paper

THE EXISTENCE OF 1-FACTORS IN LINE GRAPHS, SQUARES, AND TOTAL GRAPHSCHARTRAND G; POLIMENI AD; STEWART MJ et al.1973; PROC. KKL. NEDERL. AKAD. WETENSCH., A; NETHERL.; DA. 1973; VOL. 76; NO 3; PP. 228-232; BIBL. 1 REF.Serial Issue

A TECHNIQUE FOR RECONSTRUCTING DISCONNECTED GRAPHSCHARTRAND G; KRONK HV; SCHUSTER S et al.1973; COLLOQ. MATH.; POLOGNE; DA. 1973; VOL. 27; NO 1; PP. 31-34; BIBL. 7 REF.Serial Issue

GRAPHS WITH PRESCRIBED DEGREE SETS AND GIRTHCHARTRAND G; GOULD RJ; KAPOOR SF et al.1981; PERIOD. MATH. HUNG.; ISSN 0031-5303; HUN; DA. 1981; VOL. 12; NO 4; PP. 261-266; BIBL. 2 REF.Article

THE MIN-MAX SUPERGRAPHCHARTRAND G; GOULD RJ; KAPOOR SF et al.1980; MATH. SLOV.; CSK; DA. 1980; VOL. 30; NO 2; PP. 175-179; ABS. RUS; BIBL. 3 REF.Article

A SUFFICIENT CONDITION FOR GRAPHS WITH 1-FACTORSCHARTRAND G; GOLDSMITH DL; SCHUSTER S et al.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 41; NO 2; PP. 339-344; BIBL. 3 REF.Article

THE SQUARE OF A BLOCK IS HAMILTONIAN CONNECTED.CHARTRAND G; HOBBS AM; JUNG HA et al.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 16; NO 3; PP. 290-292; BIBL. 5 REF.Article

ON RANDOMLY 3-AXIAL GRAPHSALAVI Y; ANDERSON SS; CHARTRAND G et al.1982; BULL. AUST. MATH. SOC.; ISSN 0004-9727; AUS; DA. 1982; VOL. 25; NO 2; PP. 187-206; BIBL. 2 REF.Article

RANDOMLY K-AXIAL GRAPHSBURNS D; CHARTRAND G; KAPOOR SF et al.1981; BULL. AUST. MATH. SOC.; ISSN 0004-9727; AUS; DA. 1981; VOL. 23; NO 1; PP. 143-156; BIBL. 2 REF.Article

Hamiltonian path graphsCHARTRAND, G; KAPOOR, S. F; NORDHAUS, E. A et al.Journal of graph theory. 1983, Vol 7, Num 4, pp 419-427, issn 0364-9024Article

The ubiquitous Petersen graphCHARTRAND, G; HEVIA, H; WILSON, R. J et al.Discrete mathematics. 1992, Vol 100, Num 1-3, pp 303-311, issn 0012-365XArticle

Connected graphs containing a given connected graph as a unique greastest common subgraphCHARTRAND, G; JOHNSON, M; OELLERMANN, O. R et al.Aequationes mathematicae (Printed ed.). 1986, Vol 31, Num 2-3, pp 213-222, issn 0001-9054Article

On eccentric vertices in graphsCHARTRAND, G; SCHULTZ, M; WINTERS, S. J et al.Networks (New York, NY). 1996, Vol 28, Num 4, pp 181-186, issn 0028-3045Article

Bipartite regulation numbersALAVI, Y; CHARTRAND, G; OELLERMANN, O. R et al.Discrete mathematics. 1986, Vol 62, Num 2, pp 113-118, issn 0012-365XArticle

Smallest regular graphs without near-1 factorsCHARTRAND, G; RUIZ, S; WALL, C. E et al.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1986, Vol 41, Num 2, pp 193-210, issn 0334-3316Article

Eccentric graphsCHARTRAND, G; WEIZHEN GU; SCHULTZ, M et al.Networks (New York, NY). 1999, Vol 34, Num 2, pp 115-121, issn 0028-3045Article

Directed distance in digraphs: centers and mediansCHARTRAND, G; JOHNS, G. L; SONGLIN TIAN et al.Journal of graph theory. 1993, Vol 17, Num 4, pp 509-521, issn 0364-9024Article

A matter of degreeCHARTRAND, G; HEVIA, H; OELLERMANN, O et al.SIAM journal on discrete mathematics. 1989, Vol 2, Num 4, pp 456-466, 11 p.Article

On maximum matchings in cubic graphs with a bounded number of bridge-covering pathsCHARTRAND, G; KAPOOR, S. F; OELLERMANN, O. R et al.Bulletin of the Australian Mathematical Society. 1987, Vol 36, Num 3, pp 441-447, issn 0004-9727Article

Principal common divisors of graphsCHARTRAND, G; GODDARD, W; HENNING, M. A et al.European journal of combinatorics. 1993, Vol 14, Num 2, pp 85-93, issn 0195-6698Article