Abstract
A finite, undirected graph is called locally connected, if the neighborhood of every vertex induces a connected subgraph. In this paper we study the existence of edges in locally connected k-connected graphs whose contraction keeps the graph locally connected k-connected. As an application, we prove that the statement of the famous cycle double cover conjecture is true for locally connected graphs. Moreover, we prove that a conjecture of Plummer and Toft on cyclic colorings of 3-connected planar graphs holds when restricted to locally connected graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.