Abstract
The aim of this paper is to prove that double starlike trees are embedable into hypercubes, which answers an open question posed by Ivan Havel (Časopis Pěst. Mat. 109 (1984) 135). For this, a theorem about partitioning the hypercubes into vertex-disjoint cycles of even length is first proved. This theorem is then used to prove that a new family of graphs, the MD-graphs, are embedable into hypercubes. Finally, we prove that the double starlike trees are themselves embedable into the MD-graphs, so are in the hypercubes.
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.
