| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902941 | Discrete Mathematics | 2018 | 6 Pages |
Abstract
Recently, Balogh et al. (2018) answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree 3. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Boštjan Brešar, Jasmina Ferme,