Degree Sums for Edges and Cycle Lengths in Graphs

Journal of Graph Theory

Volumn 25, Issue 4, 1997, Pages 253-256

  Brandt, Stephan ^a   Veldman, Henk Jan ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Circumference; Closure; Cycle hamiltonian graph; Degree sum; Pancyclic graph; Tough graph

Indexed keywords

EID: 0031477371     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199708)25:4<253::AID-JGT2>3.0.CO;2-J     Document Type: Article

References (9)

1. J. A. Bondy, Pancyclic graphs I. J. Combinatorial Theory B 11 (1971), 80-84.
2. J. A. Bondy and V. Chvátal, A method in graph theory. Discrete Math. 15 (1976), 111-135.
3. J. A. Bondy and U. S. R. Murty, Graph theory with applications, Macmillan, London and Elsevier, New York (1976).
4. G. A. Dirac, Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2 (1952), 69-81.
5. R. Häggkvist, On the structure of non-hamiltonian graphs I. Comb., Prob. and Comp. 1 (1992), 27-34.
6. H. A. Jung, On maximal circuits in finite graphs. Ann. Discrete Math. 3 (1978), 129-144.
7. O. Ore, Note on Hamiltonian circuits. Amer. Math. Monthly 67 (1960), 55.
8. L. Pósa, A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 225-226.
9. C.-Q. Zhang, Finding critical independent sets and critical vertex subsets are polynomial problems. SIAM J. Disc. Math. 3 (1990), 431-438.