Abstract
We define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H can be obtained from two copies of K 1, 3 by adding an edge between the two vertices of degree 3. We show that every connected bipartite biclaw-free graph with minimum degree δ⩾6 has connectivity at least δ−2 and that every connected balanced bipartite biclaw-free graph with minimum degree δ⩾9 and order n⩽6δ− 14 is hamiltonian.
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.
