2-distance colorings of integer distance graphs
From MaRDI portal
Publication:1717215
DOI10.7151/dmgt.2040zbMath1404.05048arXiv1602.09111OpenAlexW2291905958MaRDI QIDQ1717215
Brahim Benmedjdoub, Isma Bouchemakh, Eric Sopena
Publication date: 7 February 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.09111
Related Items
On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ On \(d_2\)-coloring of certain families of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Coloring of integer distance graphs
- Coloring squares of planar graphs with girth six
- A survey on the distance-colouring of graphs
- Coloring the square of an outerplanar graph
- Coloring Powers of Planar Graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Circular chromatic number of distance graphs with distance sets of cardinality 3
This page was built for publication: 2-distance colorings of integer distance graphs
