The packing coloring of distance graphs \(D(k,t)\)
From MaRDI portal
Publication:2440104
DOI10.1016/j.dam.2013.10.036zbMath1284.05213arXiv1302.0721OpenAlexW187560026MaRDI QIDQ2440104
Přemysl Holub, Olivier Togni, Jan Ekstein
Publication date: 27 March 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.0721
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (20)
Packing coloring of some undirected and oriented coronae graphs ⋮ Packing coloring of Sierpiński-type graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ An infinite family of subcubic graphs with unbounded packing chromatic number ⋮ Facial packing edge-coloring of plane graphs ⋮ Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ A survey on packing colorings ⋮ Packing colorings of subcubic outerplanar graphs ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ On the packing chromatic number of subcubic outerplanar graphs ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Packing chromatic number under local changes in a graph ⋮ 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 ⋮ The packing chromatic number of hypercubes ⋮ Graphs that are critical for the packing chromatic number
Cites Work
- Packing chromatic number of distance graphs
- Colouring the real line
- Complexity of the packing coloring problem for trees
- The packing chromatic number of infinite product graphs
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Coloring of integer distance graphs
- Circular chromatic numbers of some distance graphs
- Distance graphs with finite chromatic number
- Circular chromatic numbers of a class of distance graphs
- A note on packing chromatic number of the square lattice
- On packing colorings of distance graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Unnamed Item
- Unnamed Item
This page was built for publication: The packing coloring of distance graphs \(D(k,t)\)