2018/01/30 by Boštjan Brešar, Brešar, Boštjan, Jasmina Ferme +1 · 1 citation
Computer Science · Mathematics · #05C12 #05C15 #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1801.09871
openalex publication_date 2018/01/30 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic\ngraphs, Discrete Math.~341 (2018) 474--483] answered in negative the question\nthat was posed in several earlier papers whether the packing chromatic number\nis bounded in the class of graphs with maximum degree 3. In this note, we\npresent an explicit infinite family of subcubic graphs with unbounded packing\nchromatic number.\n