Abstract
A graph G is said to be distance claw-free (in DC) if for each vertex v in V( G) the independence number of the subgraph of G induced by the set of vertices at distance i from v is at most 2 for each i⩾0. It is shown that every 3-connected graph in DC is hamilton-connected, answering affirmatively a question of Shepherd.
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.
