| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513257 | Discrete Mathematics | 2005 | 4 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Galen E. III,