%0 Journal Article
%T Excluding 4-wheels
%A Pierre Aboulker
%J Computer Science
%D 2012
%I arXiv
%X A 4-wheel is a graph formed by a cycle C and a vertex not in C that has at least four neighbors in C. We prove that a graph G that does not contain a 4-wheel as a subgraph is 4-colorable and we describe some structural properties of such a graph.
%U http://arxiv.org/abs/1202.3549v2