Acknowledgement
Supported by : NSA
References
- S. Abbasi, Spanning cycles in dense graphs, Ph.D. thesis, Rutgers University, 1999.
- B. Bollobas, Extremal Graph Theory, Academic Press, London, 1978.
- J. Bondy and V. Chvatal, A method in graph theory, Discrete Math. 15 (1976), no. 2, 111-135. https://doi.org/10.1016/0012-365X(76)90078-9
- Y. Egawa, R. Faudree, E. Gyori, Y. Ishigami, R. Schelp, and H. Wang, Vertex-disjoint cycles containing specified edges, Graphs Combin. 16 (2000), no. 1, 81-92. https://doi.org/10.1007/s003730050005
- M. H. El-Zahar, On circuits in graphs, Discrete Math. 50 (1984), no. 2-3, 227-230. https://doi.org/10.1016/0012-365X(84)90050-5
- P. Erdos and T. Gallai, On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar 10 (1959), 337-356.
- C. Magnant and K. Ozeki, Partitioning graphs into paths and cycles, J. Comb. 3 (2012), no. 2, 135-161.
- H. Wang, Covering a graph with cycles passing through given edges, J. Graph Theory 26 (1997), no. 2, 105-109. https://doi.org/10.1002/(SICI)1097-0118(199710)26:2<105::AID-JGT5>3.0.CO;2-W
- J. E.Williamson, Panconnected graph II, Period. Math. Hungar. 8 (1977), no. 2, 105-116. https://doi.org/10.1007/BF02018497
Cited by
- Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey vol.34, pp.1, 2018, https://doi.org/10.1007/s00373-017-1873-5