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
Reports (Research Report) Year : 2006

Choosability of the square of planar subcubic graphs with large girth

Abstract

We first show that the choose 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 choose number of the square of a planar graph with girth at least 9 is at most 6. We then show that the choose number of the square of a subcubic planar graph with girth at least 13 is at most 5.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5800.pdf (193.3 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070223 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070223 , version 1

Cite

Frédéric Havet. Choosability of the square of planar subcubic graphs with large girth. [Research Report] RR-5800, INRIA. 2006, pp.17. ⟨inria-00070223⟩
102 View
132 Download

Share

Gmail Facebook Twitter LinkedIn More