Degree Conditions for 2-Factors

Journal of Graph Theory

Volumn 24, Issue 2, 1997, Pages 165-173

  Brandt, Stephan ^a   Chen, Guantao ^b   Faudree, Ralph ^c   Gould, Ronald J ^d   Lesniak, Linda ^e  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b GEORGIA STATE UNIVERSITY   (United States)

^c University of Memphis   (United States)

^d EMORY UNIVERSITY   (United States)

^e DREW UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031542676     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O     Document Type: Article

References (10)

1. M. Aigner and S. Brandt, Embedding Arbitrary Graphs of Maximum Degree Two. J. London Math. Soc. (2) 48 (1993), 39-51.
2. B. Bollobás, Extremal Graph Theory. Academic Press 1978. (pg. 366, Ex. 42)
3. P. Catlin, Embedding subgraphs and coloring graphs under extremal degree conditions. Ph.D. Dissertation, Ohio State University, 1976.
4. K. Corrádi and A. Hajnal, On the maximal number of independent circuits in graph. Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439.
5. G. Dirac, Some theorems on abstract graphs. Proc. London Math Soc. 2 (1952), 69-81.
6. M. H. El-Zahar, On Circuits in Graphs. Discrete Math. 50 (1984), 227-230.
7. P. Justesen, On independent circuits in finite graphs and a conjecture of Erdös and Pósa. Annals of Discrete Math 41 (1989), 299-306.
8. R. Gould, Graph Theory. Benjamin/Cummings, Menlo Park, CA, 1988.
9. O. Ore, Note on hamiltonian circuits. Amer. Math Monthly 67 (1960), 55.
10. N. Sauer and J. Spencer, Edge disjoint placements of graphs. J. Combinatorial Theory B 25 (1978), 295-302.