A note on dominating cycles in 2-connected graphs

Discrete Mathematics

Volumn 155, Issue 1-3, 1996, Pages 13-18

  Bauer, D ^a   Schmeichel, E ^b   Veldman, H J ^c  

^a Stevens Institute of Technology   (United States)

^b SAN JOSE STATE UNIVERSITY   (United States)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042126636     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00364-O     Document Type: Article

References (21)

1. D. Bauer, H.J. Broersma, J. van den Heuvel and H.J. Veldman, On hamiltonian properties of 2-tough graphs, J. Graph Theory 18 (1994) 539-543.
2. D. Bauer, H.J. Broersma and H.J. Veldman, Around three lemmas in hamiltonian graph theory, in: R. Bodendiek and R. Henn, ed., Topics in Combinatorics and Graph Theory (Physica - Verlag, Heidelberg, 1990) 101-110.
3. D. Bauer, G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Math. 96 (1991) 33-49.
4. D. Bauer, S.L. Hakimi and E. Schmeichel, Recognizing tough graphs is NP-hard, Discrete Appl. Math. 28 (1990) 191-195.
5. D. Bauer, H.A. Jung and E. Schmeichel, On 2-connected graphs with small circumference, J. Combin. Inform. System Sci. 15 (1990) 16-24.
6. D. Bauer, A. Morgana, E. Schmeichel and H.J. Veldman, Long cycles in graphs with large degree sums, Discrete Math. 79 (1989/90) 59-70.
7. D. Bauer, A. Morgana, E. Schmeichel and H.J. Veldman, Long cycles in graphs with large degree sums, Memorandum No. 618, Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, 1987.
8. D. Bauer and E. Schmeichel, Long cycles in tough graphs, Stevens Research Reports in Mathematics 8612, Stevens Institute of Technology, Hoboken, N J, 1986.
9. D. Bauer, E. Schmeichel and H.J. Veldman. Some recent results on long cycles in tough graphs, in: Y. Alavi et al., ed., Graph Theory, Combinatorics, and Applications (Western Michigan University, Kalamazoo, MI, 1991) 113-123.
10. D. Bauer, E. Schmeichel and H.J. Veldman, Cycles in tough graphs - updating the last 4 years, Proc. of the Seventh Internat. Conf. on Graph Theory, Combinatorics, Algorithms, and Applications, (Western Michigan University, Kalamazoo, MI, 1992), to appear.
11. J.C. Bermond, On hamiltonian walks, in: C. St. J. A. Nash-Williams and J. Sheehan, eds., Proc. Fifth British Combinatorial Conference (Congressus Numerantium XV, Utilitas Mathematica, Winnipeg, 1976) 41-51.
12. J.A. Bondy, Large cycles in graphs, Discrete Math. 1 (1971) 121-131.
13. J.A. Bondy, Longest paths and cycles in graphs of high degree, Technical Report CORR 80-16, University of Waterloo, Waterloo, Ontario, 1980.
14. H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles, degree sums and neighborhood unions, Discrete Math. 121 (1993) 25-35.
15. G. Chartrand and L. Lesniak, Graphs and Digraphs. (Wadsworth, Belmont, 1986).
16. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
17. H.A. Jung, On maximal circuits in finite graphs, Ann. Discrete Math. 3 (1978) 129-144.
18. N. Linial, A lower bound on the circumference of a graph, Discrete Math. 15 (1976) 297-300.
19. Z. Skupień, An improvement of Jung's condition for hamiltonicity, 30. Internationales Wissenschaftliches Kolloquium, TH Ilmenau (GDR) 5 (1985) 111-113.
20. Y. Tian and L. Zhao, On the circumference of 1-tough graphs, Kexue Tongbao 35 (1988) 538-541.
21. H.J. Veldman, Existence of dominating cycles and paths, Discrete Math. 43 (1983) 281-296.