📖
On packing chromatic number of subcubic outerplanar graphs
Nicolas Gastineau, Přemysl Holub, Olivier Togni

On packing chromatic number of subcubic outerplanar graphs

Science & Mathematics Published 2018 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title On packing chromatic number of subcubic outerplanar graphs
Author / Organization Nicolas Gastineau, Přemysl Holub, Olivier Togni
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2018
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-246458
Original Source Link Visit Source Page on hal.science »