Packing chromatic number of distance graphs
From MaRDI portal
Publication:412353
DOI10.1016/J.DAM.2011.11.022zbMath1239.05050arXiv1105.5652OpenAlexW1625637544MaRDI QIDQ412353
Jan Ekstein, Bernard Lidický, Přemysl Holub
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.5652
Related Items (13)
Packing coloring of some undirected and oriented coronae graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ Facial packing edge-coloring of plane graphs ⋮ Packing chromatic number of certain fan and wheel related graphs ⋮ A survey on packing colorings ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ On the packing chromatic number of Moore graphs ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Unnamed Item ⋮ Modeling the packing coloring problem of graphs ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ On the independence ratio of distance graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Fractional chromatic number of distance graphs generated by two-interval sets
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- Complexity of the packing coloring problem for trees
- On the packing chromatic number of some lattices
- The packing chromatic number of infinite product graphs
- Chromatic number of prime distance graphs
- Distance graphs with finite chromatic number
- A note on packing chromatic number of the square lattice
- On packing colorings of distance graphs
- Distance graphs with maximum chromatic number
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
This page was built for publication: Packing chromatic number of distance graphs
