English

Excluding 4-wheels

Discrete Mathematics 2012-04-19 v2 Combinatorics

Abstract

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.

Cite

@article{arxiv.1202.3549,
  title  = {Excluding 4-wheels},
  author = {Pierre Aboulker},
  journal= {arXiv preprint arXiv:1202.3549},
  year   = {2012}
}
R2 v1 2026-06-21T20:20:19.155Z