Choosability of the square of planar subcubic graphs with large girth - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics Year : 2009

Choosability of the square of planar subcubic graphs with large girth

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.
Fichier principal
Vignette du fichier
girth.pdf (175.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00496423 , version 1 (23-10-2016)

Identifiers

  • HAL Id : inria-00496423 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More