Choosability of the square of planar subcubic graphs with large girth

Frédéric Havet 1
1 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 the choice number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choice number of the square of a subcubic planar graph with girth at least 9 is at most 6. We then show that the choice number of the square of a subcubic planar graph with girth at least 13 is at most 5.
Document type :
Journal articles
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00496423
Contributor : Frederic Havet <>
Submitted on : Sunday, October 23, 2016 - 4:33:34 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

File

girth.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00496423, version 1

Collections

Citation

Frédéric Havet. Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics, Elsevier, 2009, 309, pp.3553--3563. ⟨inria-00496423⟩

Share

Metrics

Record views

285

Files downloads

154