Subdivision into i-packings and S-packing chromatic number of some lattices
From MaRDI portal
Publication:3465668
DOI10.26493/1855-3974.436.178zbMath1329.05107arXiv1505.07781OpenAlexW2103722125MaRDI QIDQ3465668
Nicolas Gastineau, Hamamache Kheddouci, Olivier Togni
Publication date: 22 January 2016
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07781
triangular latticesquare latticepacking chromatic numberhexagonal latticedistance coloring\(i\)-packing
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)
Related Items (9)
Packing coloring of Sierpiński-type graphs ⋮ Packing chromatic number versus chromatic and clique number ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ A survey on packing colorings ⋮ \((d, n)\)-packing colorings of infinite lattices ⋮ Packing chromatic number of subdivisions of cubic graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
This page was built for publication: Subdivision into i-packings and S-packing chromatic number of some lattices
