Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. On the circumference of essentially 4-connected planar graphs. (English) Zbl 1433.05085 J. Graph Algorithms Appl. 24, No. 1, 21-46 (2020). Reviewer: Stelian Mihalas (Timişoara) MSC: 05C10 05C40 05C35 05C12 PDFBibTeX XMLCite \textit{I. Fabrici} et al., J. Graph Algorithms Appl. 24, No. 1, 21--46 (2020; Zbl 1433.05085) Full Text: DOI arXiv
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. Longer cycles in essentially 4-connected planar graphs. (English) Zbl 1430.05061 Discuss. Math., Graph Theory 40, No. 1, 269-277 (2020). MSC: 05C38 05C10 05C12 05C40 PDFBibTeX XMLCite \textit{I. Fabrici} et al., Discuss. Math., Graph Theory 40, No. 1, 269--277 (2020; Zbl 1430.05061) Full Text: DOI arXiv
Böhme, Thomas; Harant, Jochen On Hamiltonian cycles in 4- and 5-connected plane triangulations. (English) Zbl 0958.05085 Discrete Math. 191, No. 1-3, 25-30 (1998). MSC: 05C45 PDFBibTeX XMLCite \textit{T. Böhme} and \textit{J. Harant}, Discrete Math. 191, No. 1--3, 25--30 (1998; Zbl 0958.05085) Full Text: DOI
Harant, Jochen; Owens, Peter J. Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs. (English) Zbl 0838.05043 Discrete Math. 147, No. 1-3, 301-305 (1995). MSC: 05C10 PDFBibTeX XMLCite \textit{J. Harant} and \textit{P. J. Owens}, Discrete Math. 147, No. 1--3, 301--305 (1995; Zbl 0838.05043) Full Text: DOI
Harant, Jochen Toughness and nonhamiltonicity of polyhedral graphs. (English) Zbl 0771.05057 Discrete Math. 113, No. 1-3, 249-253 (1993). MSC: 05C35 05C10 PDFBibTeX XMLCite \textit{J. Harant}, Discrete Math. 113, No. 1--3, 249--253 (1993; Zbl 0771.05057) Full Text: DOI