Abstract
For integers i, j, k with $${i\geq j\geq k\geq 0}$$ , let N i, j, k be the graph obtained by identifying end vertices of three disjoint paths of lengths i, j, k to the vertices of a triangle. In this paper, we show that every 3-connected {K 1,3, N i, 7-i, 2}-free graph is hamiltonian, where $${i \in \{4,5\}}$$ . This result is sharp in the sense that no one of the numbers i, 7?i and 2 in N i, 7-i, 2 can be replaced by a larger number.
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.
