Back to Search
Start Over
An infinite family of subcubic graphs with unbounded packing chromatic number.
- Source :
-
Discrete Mathematics . Aug2018, Vol. 341 Issue 8, p2337-2342. 6p. - Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 341
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 129973602
- Full Text :
- https://doi.org/10.1016/j.disc.2018.05.004