Chordality and 2-factors in tough graphs

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 323-329

  Bauer, D ^a   Katona, G Y ^b   Kratsch, D ^c   Veldman, H J ^d  

^a Stevens Institute of Technology   (United States)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^d UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

05C38; 2 factors; 68R10; Chordal graphs; Toughness

Indexed keywords

EID: 0038621278     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00142-0     Document Type: Article

References (12)

1. D. Bauer, H.J. Broersma, H.J. Veldman, Not every 2 -tough graph is hamiltonian, Discrete Appl. Math., this volume.
2. D. Bauer, E. Schmeichel, Toughness, minimum degree and the existence of 2-factors, J. Graph Theory 18(3) (1994) 241-256.
3. D. Bauer, E. Schmeichel, H.J. Veldman, Some recent results on long cycles in tough graphs, in: Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications - Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Wiley, New York, 1991, pp. 113-121.
4. D. Bauer, E. Schmeichel, H.J. Veldman, Cycles in tough graphs - updating the last four years, in: Y. Alavi, A.J. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications - Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Wiley, New York, 1995, pp. 19-34.
5. D. Bauer, E. Schmeichel, H.J. Veldman, Progress on tough graphs - another four years, in: Graph Theory, Combinatorics, and Applications - Proceedings of the Eighth Quadrennial International Conference on the Theory and Applications of Graphs.
6. Belck H.B. Reguläre Faktoren von Graphen. J. Reine Angew. Math. 188:1950;228-252.
7. G. Chartrand, L. Lesniak, Graphs and Digraphs, Chapman & Hall, London, 1996.
8. Chen G., Jacobson M.S., Kézdy A.E., Lehel J. Tough enough chordal graphs are hamiltonian. Networks. 31:1998;29-38.
9. Chvátal V. Tough graphs and hamiltonian circuits. Discrete Math. 5:1973;215-228.
10. Enomoto H., Jackson B., Katerinis P., Saito A. Toughness and the existence of. k -factors J. Graph Theory. 9:1985;87-95.
11. Kratsch D., Lehel J., Müller H. Toughness, hamiltonicity and split graphs. Discrete Math. 150:1996;231-245.
12. Tutte W.T. The factors of graphs. Canad. J. Math. 4:1952;314-328.