The subgraph homeomorphism problem for small wheels (Q1117247): Difference between revisions

The author quickly shows that every vertex of degree at least 4 in a 3- connected graph is the ``hub'' of a subdivision of a wheel with four spokes. Using this result he then proves, by extensive case analysis, that a graph G contains a subdivision of a 5-spoked wheel if it is 3- connected, has a vertex v of degree 5 and a cycle of length at least 5 that does not contain v, and does not have a set E of three edges such that each component of G-E has more than one vertex.