RT journal article
T1 Injective Colorings of Sierpiński-like Graphs and Kneser Graphs
A1 Brešar, Boštjan
A1 Klavžar, Sandi
A1 Samadi, Babak
A1 González Yero, Ismael
A2 Matemáticas
K1 Injective coloring
K1 Injective chromatic number
K1 Perfect injectively colorable graph
K1 Sierpiński graph
K1 Kneser graph
K1 Rooted product graph
AB Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine theinjective chromatic number of Sierpiński graphs and to give a short proof thatSierpiński graphs are Class 1. Sierpiński-like graphs are also considered, includinggeneralized Sierpiński graphs over cycles and rooted products. It is proved that theinjective chromatic number of a rooted product of two graphs lies in a set of sixpossible values. Sierpiński graphs and Kneser graphs K(n, r) are considered withrespect of being perfect injectively colorable, where a graph is perfect injectivelycolorable if it has an injective coloring in which every color class forms an openpacking of largest cardinality. In particular, all Sierpiński graphs and Kneser graphsK(n, r) with n ≥ 3r − 1 are perfect injectively colorable, while K(7, 3) is not.
PB Springer
SN 1435-5914
YR 2025
FD 2025-07-24
LK http://hdl.handle.net/10498/37867
UL http://hdl.handle.net/10498/37867
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-may-2026