Abstract
We say a graph G is minimal with respect to a property Q if there exists no proper induced subgraph G′ of G with property Q. In this paper we characterize all minimal graphs with respect to the property ‘to be 2-connected, non-hamiltonian and claw-free’. Several sufficient forbidden subgraph conditions are obtained as corollaries.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
