Abstract
In this paper, we prove that if every vertex of a simple graph has degree at least δ , then it has a subgraph that is isomorphic to a subdivision of a δ -wheel. We then extend a result of Dirac showing that every graph with a chromatic number exceeding n has a subgraph that is a subdivision of the n-wheel.
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.
