Abstract

For each k ≥ 2 , we construct a k -connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example of a 3-connected maximal plane graph not containing two completely independent spanning trees.

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

Disclaimer: 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.