Weakly Pancyclic Graphs

Journal of Graph Theory

Volumn 27, Issue 3, 1998, Pages 141-176

  Brandt, Stephan ^a   Faudree, Ralph ^b   Goddard, Wayne ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b University of Memphis   (United States)

^c UNIVERSITY OF KWAZULU NATAL   (South Africa)

Author keywords

Cycles; Hamiltonicity; Pancyclic

Indexed keywords

EID: 0032327224     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199803)27:3<141::AID-JGT3>3.0.CO;2-O     Document Type: Article

References (46)

1. N. Alon, Tough Ramsey graphs without short cycles. J. Algebr. Comb. 4 (1995), 189-195.
2. D. Amar, E. Flandrin, I. Fournier, and A. Germa, Pancyclism in hamiltonian graphs, Discrete Math. 89 (1991), 111-131.
3. D. Amar, I. Fournier, and A. Germa, Pancyclism in Chvátal-Erdos graphs, Graphs Combin. 7 (1991), 101-112.
4. D. Bauer, H. J. Broersma, J. Van Den Heuvel, and H. J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree, Discrete Math. 141 (1995), 1-10.
5. D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2-tough graph is hamiltonian, preprint (1997).
6. D. Bauer, J. Van Den Heuvel, and E. Schmeichel, Toughness and triangle-free graphs, J. Combin. Theory Ser. B 65 (1995), 208-221.
7. B. Bollobás, Extremal Graph Theory, Academic Press, London (1978).
8. J. A. Bondy, Pancyclic graphs I, J. Combin. Theory Ser. B 11 (1971), 80-84.
9. J. A. Bondy, Pancyclic graphs, in: Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing (1971), 167-172.
10. J. A. Bondy and B. Jackson, Long paths between specified vertices of a block, Ann. Discrete Math. 27 (1985), 195-200.
11. S. Brandt, Cycles and paths in triangle-free graphs, in: The Mathematics of Paul Erdos (R. Graham, J. Nešetřil, eds.), Springer (1996), 32-42.
12. S. Brandt, Sufficient conditions for graphs to contain all subgraphs of a given type, Ph.D. thesis, Freie Universität Berlin (1994).
13. S. Brandt, A sufficient condition for all short cycles, Discrete Appl. Math., to appear.
14. H. J. Broersma, J. P. M. Van Den Heuvel, B. Jackson, and H. J. Veldman, Hamiltonicity of regular 2-connected graphs, J. Graph Theory 22 (1996), 105-124.
15. V. Chvátal and P. Erdos, A note on hamiltonian circuits, Discrete Math. 2 (1972), 111-113.
16. V. Chvátal, Tough graphs and hamiltonian cycles, Discrete Math. 5 (1973), 215-228.
17. G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 69-81.
18. R. J. Faudree and R. H. Schelp, Path connected graphs, Acta Math. Acad. Sci. Hungar. 25 (1914), 313-319.
19. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to NP-completeness, Freeman, New York (1979).
20. W. Goddard and D. J. Kleitman, A note on maximal triangle-free graphs, J. Graph Theory 17 (1993), 629-631.
21. R. Häggkvist, On the structure of non-hamiltonian graphs I, Combin. Prob. Comput. 1 (1992), 27-34.
22. R. Häggkvist, R. J. Faudree, and R. H. Schelp, Pancyclic graphs - connected Ramsey number, Ars Combin. 11 (1981), 37-49.
23. R. Häggkvist and G. Nicoghossian, A remark on hamiltonian cycles, J. Combin. Theory Ser. B 30 (1981), 118-120.
24. G. R. T. Hendry and S. Brandt, An extremal problem for cycles in hamiltonian graphs, Graphs Combin. 11 (1995), 255-262.
25. B. Jackson, Hamiltonian cycles in regular 2-connected graphs, J. Combin. Theory Ser. B 29 (1980), 27-46.
26. B. Jackson, Hamiltonian cycles in 7-connected line graphs, preprint (1989).
27. B. Jackson and O. Ordaz, Chvátal-Erdos conditions for paths and cycles in graphs and digraphs. A survey, Discrete Math. 84 (1990), 241-254.
28. H. A. Jung, Long cycles in graphs with moderate connectivity, in: Topics in combinatorics and graph theory (R. Bodendiek, R. Henn, eds.), Physica, Heidelberg (1990), 765-778.
29. Dingjun Lou, The Chvátal-Erdos condition for cycles in triangle-free graphs, Discrete Math. 152 (1996), 253-257.
30. 1.3-free graphs, J. Graph Theory 8 (1984), 139-146.
31. J. Mitchem and E. Schmeichel, Bipartite graphs with cycles of all even lengths, J. Graph Theory 6 (1982), 429-439.
32. C. St. J. A. Nash-Williams, Edge-disjoint hamiltonian circuits in graphs with vertices of large valency, in: Studies in Pure Mathematics (L. Mirsky ed.), Academic Press, London (1971), 157-183.
33. Z. Ryjáček, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997), 217-224.
34. E. F. Schmeichel and S. L. Hakimi, A cycle structure theorem for Hamiltonian graphs, J. Combin. Theory Ser. B 45 (1988), 99-107.
35. Shi Rong-Hua, The binding number of a graph and its triangle, Acta Math. Appl. Sinica (English Ser.) 2 (1985), 79-86.
36. Shi Rong-Hua, The binding number of a graph and its pancyclism, Acta Math. Appl. Sinica (English Ser.) 3 (1987), 257-269.
37. Shi Rong-Hua, Some notes on hamiltonian graphs. Kexue Tongbao 32 (1987), 1002-1003.
38. Shi Rong-Hua, Ore-type conditions for pancyclism of Hamiltonian graphs, J. Systems Sci. Math. Sci. 11 (1991), 79-90.
39. Trommel, H. J. Veldman, and Verschut, Manuscript (1997).
40. Tian Feng and Zang Wenan, Bipancyclism in Hamiltonian bipartite graphs, Systems Sci. Math. Sci. 2 (1989), 22-31.
41. λ-paths, Discrete Math. 44 (1991), 309-316.
42. H. J. Veldman, Unpublished.
43. D. R. Woodall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B 15 (1973), 225-255.
44. N. C. Wormald, The asymptotic connectivity of labelled regular graphs, J. Combin. Theory Ser. B 31 (1981), 156-167.
45. N. C. Wormald, The asymptotic distribution of short cycles in random regular graphs, J. Combin. Theory Ser. B 31 (1981), 168-182.
46. S. Zhan, On hamiltonian line graphs and connectivity, Discrete Math. 89 (1991), 89-95.