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.
Type de document :
Pré-publication, Document de travail
2017
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01489300
Contributeur : Nicolas Gastineau <>
Soumis le : jeudi 18 mai 2017 - 15:27:52
Dernière modification le : samedi 20 mai 2017 - 01:09:48

Fichiers

outerplanar v20170513.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

42

Téléchargements du document

6