• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

On the packing chromatic number of subcubic outerplanar graphs

Gastineau, Nicolas; Holub, Přemysl; Togni, Olivier (2019), On the packing chromatic number of subcubic outerplanar graphs, Discrete Applied Mathematics, 255, p. 209-221. 10.1016/j.dam.2018.07.034

Type
Article accepté pour publication ou publié
External document link
https://arxiv.org/abs/1703.05023v3
Date
2019
Journal name
Discrete Applied Mathematics
Volume
255
Publisher
Elsevier
Pages
209-221
Publication identifier
10.1016/j.dam.2018.07.034
Metadata
Show full item record
Author(s)
Gastineau, Nicolas
Holub, Přemysl
Togni, Olivier cc
Abstract (EN)
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exist 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.
Subjects / Keywords
Packing colouring; Packing chromatic number; Outerplanar graphs; Subcubic graphs

Related items

Showing items related by title and author.

  • Thumbnail
    On S-packing edge-colorings of cubic graphs 
    Gastineau, Nicolas; Togni, Olivier (2019) Article accepté pour publication ou publié
  • Thumbnail
    Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees 
    Darties, Benoit; Gastineau, Nicolas; Togni, Olivier (2018) Article accepté pour publication ou publié
  • Thumbnail
    Completely independent spanning trees for enhancing the robustness in ad-hoc Networks 
    Moinet, Axel; Darties, Benoit; Gastineau, Nicolas; Baril, Jean-Luc; Togni, Olivier (2017) Communication / Conférence
  • Thumbnail
    Blockers for the stability number and the chromatic number 
    Bazgan, Cristina; Bentz, Cédric; Picouleau, Christophe; Ries, Bernard (2015) Article accepté pour publication ou publié
  • Thumbnail
    On the maximum independent set problem in subclasses of subcubic graphs 
    Ries, Bernard; Monnot, Jérôme; Lozin, Vadim (2015) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo