On packing chromatic number of subcubic outerplanar graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2018

On packing chromatic number of subcubic outerplanar graphs

Résumé

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.
Fichier principal
Vignette du fichier
outerplanarhal.pdf (247.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01489300 , version 1 (14-03-2017)
hal-01489300 , version 2 (18-05-2017)
hal-01489300 , version 3 (25-07-2018)

Identifiants

Citer

Nicolas Gastineau, Přemysl Holub, Olivier Togni. On packing chromatic number of subcubic outerplanar graphs. 2018. ⟨hal-01489300v3⟩
239 Consultations
274 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More