On Longest Cycles in Essentially 4-Connected Planar Graphs
Igor Fabrici; Jochen Harant; Stanislav Jendroľ
Discussiones Mathematicae Graph Theory (2016)
- Volume: 36, Issue: 3, page 565-575
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] J.A. Bondy and U.S.R. Murty, Graph Theory (Springer, 2008).
- [2] I. Fabrici, J. Harant and S. Jendroľ, Paths of low weight in planar graphs, Discuss. Math. Graph Theory 28 (2008) 121-135. doi:10.7151/dmgt.1396[Crossref] Zbl1155.05010
- [3] B. Grünbaum and J. Malkevitch, Pairs of edge-disjoint Hamilton circuits, Aequationes Math. 14 (1976) 191-196. doi:10.1007/BF01836218[Crossref] Zbl0331.05118
- [4] B. Jackson and N.C. Wormald, Longest cycles in 3-connected planar graphs, J. Combin. Theory Ser. B 54 (1992) 291-321. doi:10.1016/0095-8956(92)90058-6[Crossref] Zbl0696.05031
- [5] D.P. Sanders, On paths in planar graphs, J. Graph Theory 24 (1997) 341-345. doi:10.1002/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-O[Crossref]
- [6] C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176. doi:10.1002/jgt.3190070205[Crossref]
- [7] W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116. doi:10.1090/S0002-9947-1956-0081471-8[Crossref] Zbl0070.18403
- [8] C.-Q. Zhang, Longest cycles and their chords, J. Graph Theory 11 (1987) 521-529. doi:10.1002/jgt.3190110409[Crossref]