Abstract
AbstractWe consider a generalization of the pancyclic property. A graph G is defined to be 1‐pancyclic if there is some Hamilton cycle H in G such that we can find a cycle Cs of length s (3 ⩽ s ⩽ n − 1) using only the edges of H and one other edge es. We show that the threshold for Gn,p to be Hamiltonian, is the threshold for the 1‐pancyclic property.
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.
