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

On packing chromatic number of subcubic outerplanar graphs

Abstract : Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 Sierpiński graphs and hexagonal lattices. In this paper we are interested in the packing chromatic number of subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the outerplanar graphs and determine sharper bounds for some classes of subcubic outerplanar graphs.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01489300
Contributor : Nicolas Gastineau <>
Submitted on : Wednesday, July 25, 2018 - 12:43:22 PM
Last modification on : Monday, March 30, 2020 - 8:44:56 AM
Document(s) archivé(s) le : Friday, October 26, 2018 - 12:13:34 PM

Files

outerplanarhal.pdf
Files produced by the author(s)

Identifiers

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

Citation

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

Share

Metrics

Record views

178

Files downloads

395