5-colouring graphs with 4 crossings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

5-colouring graphs with 4 crossings

Abstract

We disprove a conjecture of Oporowski and Zhao stating that every graph with crossing number at most 5 and clique number at most 5 is 5-colourable. However, we show that every graph with crossing number at most 4 and clique number at most 5 is 5-colourable. We also show some colourability results on graphs that can be made planar by removing few edges. In particular, we show that if there exists three edges whose removal leaves the graph planar then it is 5-colourable.
Fichier principal
Vignette du fichier
RR-7110.pdf (330.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00437726 , version 1 (01-12-2009)

Identifiers

  • HAL Id : inria-00437726 , version 1

Cite

Rok Erman, Frédéric Havet, Bernard Lidicky, Ondrej Pangrac. 5-colouring graphs with 4 crossings. [Research Report] RR-7110, INRIA. 2009. ⟨inria-00437726⟩
153 View
98 Download

Share

Gmail Facebook Twitter LinkedIn More