arXiv Open Access 2012

Excluding 4-wheels

Pierre Aboulker

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM math.CO

Penulis (1)

Pierre Aboulker

Format Sitasi

APA MLA BibTeX

Aboulker, P. (2012). Excluding 4-wheels. https://arxiv.org/abs/1202.3549

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓