Skip to Main content Skip to Navigation
Reports

5-choosability of graphs with 2 crossings

Victor Campos 1 Frédéric Havet 2
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
Document type :
Reports
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00593426
Contributor : Frederic Havet <>
Submitted on : Saturday, May 21, 2011 - 8:59:55 AM
Last modification on : Monday, October 12, 2020 - 10:30:26 AM
Long-term archiving on: : Friday, November 9, 2012 - 11:50:36 AM

File

RR-7618.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00593426, version 1

Citation

Victor Campos, Frédéric Havet. 5-choosability of graphs with 2 crossings. [Research Report] RR-7618, INRIA. 2011, pp.22. ⟨inria-00593426⟩

Share

Metrics

Record views

293

Files downloads

144