Abstract

Hoffmann–Ostenhof’s conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a 2-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic graphs and 4-chordal subcubic graphs.

Full Text
Paper version not known

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.