On wheel-free graphs
classification
🧮 math.CO
keywords
graphwheelconnectedcontaincycleeverysubgraphchordless
read the original abstract
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We give a new proof of a theorem of Thomassen and Toft: every graph that does not contain a wheel as a subgraph is 3-colorable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.