Abstract
A long standing conjecture of Havel (1984) [10] states that every equipartite tree with maximum degree 3 on 2 n vertices is a spanning subgraph of the n -dimensional hypercube. The conjecture is known to be true for many subclasses of trees. Havel and Liebl (1986) [12] showed that every equipartite caterpillar with maximum degree 3 and having 2 n vertices is a spanning subgraph of the n -dimensional hypercube. Subsequently, Havel (1990) [11] remarked that the problem of verification of the conjecture for subdivisions of caterpillars with maximum degree 3 has remained open. In this paper, we show that a subdivision of a caterpillar with 2 n vertices and maximum degree 3 is a spanning subgraph of the n -dimensional hypercube if it is equipartite and has at most n − 3 vertices on the spine. The problem of embedding such trees that have spines of arbitrary length is still open.
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.
