Packing colouring of some classes of cubic graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Australasian Journal of Combinatorics Année : 2018

Packing colouring of some classes of cubic graphs

Daouya Laïche
  • Fonction : Auteur

Résumé

The packing chromatic number χ ρ (G) of a graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1 ,. .. , V k , in such a way that every two distinct vertices in V i are at distance greater than i in G for every i, 1 ≤ i ≤ k. Recently, Balogh, Kostochka and Liu proved that χ ρ is not bounded in the class of subcubic graphs [Packing chromatic number of subcubic graphs, Discrete Math. 341 (2018), 474483], thus answering a question previously addressed in several papers. However, several subclasses of cubic or subcubic graphs have bounded packing chromatic number. In this paper, we determine the exact value of, or upper and lower bounds on, the packing chromatic number of some classes of cubic graphs, namely circular ladders, and so-called H-graphs and generalised H-graphs.
Fichier principal
Vignette du fichier
R2_Packing colouring of some classes of cubic graphs.pdf (399.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01854984 , version 1 (07-08-2018)
hal-01854984 , version 2 (14-08-2018)

Identifiants

Citer

Daouya Laïche, Eric Sopena. Packing colouring of some classes of cubic graphs. The Australasian Journal of Combinatorics, 2018, 72 (2), pp.376-404. ⟨hal-01854984v2⟩

Collections

CNRS TDS-MACS
49 Consultations
43 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More