For Sierpiński products of complete graphs, paths, and stars, the paper determines or bounds the minimum and maximum packing chromatic number over all connecting functions, and gives a polynomial-time recognition algorithm for products of two trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On Sierpi\'{n}ski packing chromatic number and recognition of Sierpi\'{n}ski products
For Sierpiński products of complete graphs, paths, and stars, the paper determines or bounds the minimum and maximum packing chromatic number over all connecting functions, and gives a polynomial-time recognition algorithm for products of two trees.