On Tutte cycles containing three prescribed edges

arXiv2106.09617MaRDI QIDQ6370570FDOQ6370570

Authors: Michael C. Wigal, Xingxing Yu 

Publication date: 17 June 2021

Abstract: A cycle $C$ in a graph $G$ is called a Tutte cycle if, after deleting $C$ from $G$, each component has at most three neighbors on $C$. Tutte cycles play an important role in the study of Hamiltonicity of planar graphs. Thomas and Yu and independently Sanders proved the existence of Tutte cycles containining three specified edges of a facial cycle in a 2-connected plane graph. We prove a quantitative version of this result, bounding the number of components of the graph obtained by deleting a Tutte cycle. As a corollary, we can find long cycles in essentially 4-connected plane graphs that also contain three prescribed edges of a facial cycle.

This page was built for publication: On Tutte cycles containing three prescribed edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370570)