On wheel-free graphs
Combinatorics
2013-09-10 v1
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.
Keywords
Cite
@article{arxiv.1309.2113,
title = {On wheel-free graphs},
author = {Pierre Aboulker and Frédéric Havet and Nicolas Trotignon},
journal= {arXiv preprint arXiv:1309.2113},
year = {2013}
}
Comments
Unpublished