Abstract
The circumference of a graph is the length of its longest cycles. Jackson established a conjecture of Bondy by showing that the circumference of a 3-connected cubic graph of order n is Ω(n0.694). Bilinski et al. improved this lower bound to Ω(n0.753) by studying large Eulerian subgraphs in 3-edge-connected graphs. In this paper, we further improve this lower bound to Ω(n0.8). This is done by considering certain 2-connected cubic graphs, finding cycles through two given edges, and distinguishing the cases according to whether or not these edges are adjacent.
Sign-in/Register to access full text options 
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.
