Abstract
A graph G is supereulerian if it has a spanning eulerian subgraph. We prove that every 3-edge-connected graph with the circumference at most 11 has a spanning eulerian subgraph if and only if it is not contractible to the Petersen graph. As applications, we determine collections F1, F2 and F3 of graphs to prove each of the following(i) Every 3-connected {K1,3,Z9}-free graph is hamiltonian if and only if its closure is not a line graph L(G) for some G∈F1.(ii) Every 3-connected {K1,3,P12}-free graph is hamiltonian if and only if its closure is not a line graph L(G) for some G∈F2.(iii) Every 3-connected {K1,3,P13}-free graph is hamiltonian if and only if its closure is not a line graph L(G) for some G∈F3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
