Abstract
The Kneser graph K(n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph Ok is a special case of Kneser graph when n = 2k + 1. A long standing conjecture claims that Ok is hamiltonian for all k>2. We show that the prism over Ok is hamiltonian for all k even. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:177-188, 2011
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.
