An infinite family of subcubic graphs with unbounded packing chromatic number |
| |
| Authors: | Boštjan Brešar Jasmina Ferme |
| |
| Affiliation: | 1. Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia;2. Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia;3. Faculty of Education, University of Maribor, Slovenia |
| |
| 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. |
| |
| Keywords: | Packing Coloring Packing coloring Diameter Subcubic graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
