Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On packing chromatic number of subcubic outerplanar graphs

Abstract : The question of whether subcubic graphs have finite packing chromatic number or not is still open although positive responses are known for some subclasses, including subcubic trees, base-3 Sierpiski graphs and hexagonal lattices. In this paper, we answer positively to the question for some subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the weak dual of the outerplanar graphs and determine sharper bounds on some classes of subcubic outerplanar graphs.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01489300
Contributor : Nicolas Gastineau <>
Submitted on : Thursday, May 18, 2017 - 3:27:52 PM
Last modification on : Wednesday, March 11, 2020 - 12:06:03 PM

Files

outerplanar v20170513.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01489300, version 2
  • ARXIV : 1703.05023

Citation

Nicolas Gastineau, Přemysl Holub, Olivier Togni. On packing chromatic number of subcubic outerplanar graphs. 2017. ⟨hal-01489300v2⟩

Share

Metrics

Record views

160

Files downloads

128