Packing coloring of Sierpi\'{n}ski-type graphs
Bo\v{s}tjan Bre\v{s}ar, Jasmina Ferme

TL;DR
This paper investigates the packing chromatic number of various Sierpiński-type graphs, revealing bounds and unboundedness depending on the graph's base and structure, advancing understanding of graph coloring properties.
Contribution
It establishes bounds and unboundedness results for the packing chromatic number in different families of Sierpiński graphs, including generalized cases.
Findings
Packing chromatic number is bounded by 8 for Sierpiński graphs with base 3.
It is unbounded for bases greater than 3.
Upper bound of 31 for Sierpiński triangle graphs.
Abstract
The packing chromatic number of a graph is the smallest integer such that the vertex set of can be partitioned into sets , , where each is an -packing. In this paper, we consider the packing chromatic number of several families of Sierpi\'{n}ski-type graphs. While it is known that this number is bounded from above by in the family of Sierpi\'{n}ski graphs with base , we prove that it is unbounded in the families of Sierpi\'{n}ski graphs with bases greater than . On the other hand, we prove that the packing chromatic number in the family of Sierpi\'{n}ski triangle graphs is bounded from above by . Furthermore, we establish or provide bounds for the packing chromatic numbers of generalized Sierpi\'{n}ski graphs with respect to all connected graphs of order 4.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
