On Sierpiński packing chromatic number and recognition of Sierpiński products
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912472991006720 |
|---|---|
| author | Holub, Přemysl Klavžar, Sandi |
| author_facet | Holub, Přemysl Klavžar, Sandi |
| contents | The Sierpiński product $G \otimes _f H$ of graphs $G$ and $H$ with respect to a function $f \colon V(G)\rightarrow V(H)$ has the vertex set $V(G)\times V(H)$. For every $g\in V(G)$ it contains a disjoint copy $gH$ of $H$, and for every edge $gg'$ of $G$ there is the edge $(g,f(g'))(g',f(g))$ between $gH$ and $g'H$. In this paper, the Sierpiński packing chromatic number is defined as the minimum of $χ_ρ(G\otimes _f H)$ over all functions $f$, where $χ_ρ(X)$ is the packing chromatic number of $X$. The upper Sierpiński packing chromatic number is analogously defined as the maximum corresponding value. The (upper) Sierpiński packing chromatic number is determined for all Sierpiński product graphs whose both factors are complete. Sierpiński product graphs whose factors are paths or stars are also studied. Their Sierpiński packing chromatic number is always $3$, while their upper Sierpiński packing chromatic number is bounded from below and above. It is also proved that for a given graph $G$, it can be checked in polynomial time whether $G$ has a representation as a Sierpiński product graphs both factors of which being trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_06730 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Sierpiński packing chromatic number and recognition of Sierpiński products Holub, Přemysl Klavžar, Sandi Combinatorics The Sierpiński product $G \otimes _f H$ of graphs $G$ and $H$ with respect to a function $f \colon V(G)\rightarrow V(H)$ has the vertex set $V(G)\times V(H)$. For every $g\in V(G)$ it contains a disjoint copy $gH$ of $H$, and for every edge $gg'$ of $G$ there is the edge $(g,f(g'))(g',f(g))$ between $gH$ and $g'H$. In this paper, the Sierpiński packing chromatic number is defined as the minimum of $χ_ρ(G\otimes _f H)$ over all functions $f$, where $χ_ρ(X)$ is the packing chromatic number of $X$. The upper Sierpiński packing chromatic number is analogously defined as the maximum corresponding value. The (upper) Sierpiński packing chromatic number is determined for all Sierpiński product graphs whose both factors are complete. Sierpiński product graphs whose factors are paths or stars are also studied. Their Sierpiński packing chromatic number is always $3$, while their upper Sierpiński packing chromatic number is bounded from below and above. It is also proved that for a given graph $G$, it can be checked in polynomial time whether $G$ has a representation as a Sierpiński product graphs both factors of which being trees. |
| title | On Sierpiński packing chromatic number and recognition of Sierpiński products |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.06730 |