A generalization of Dirac's theorem: Subdivisions of wheels
暂无分享,去创建一个
In this paper, we prove that if every vertex of a simple graph has degree at least @d, then it has a subgraph that is isomorphic to a subdivision of a @d-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.
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] G. Dirac. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .
[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .