A survey on the distance-colouring of graphs
From MaRDI portal
Publication:2468029
DOI10.1016/j.disc.2006.11.059zbMath1130.05026OpenAlexW2017604542MaRDI QIDQ2468029
Publication date: 30 January 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.059
Related Items (41)
\(S\)-packing colorings of cubic graphs ⋮ Almost injective colorings ⋮ List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Distant set distinguishing total colourings of graphs ⋮ Chromatic numbers of exact distance graphs ⋮ Silver block intersection graphs of Steiner 2-designs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Distant irregularity strength of graphs ⋮ LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS ⋮ Distant set distinguishing edge colourings of graphs ⋮ On conflict-free proper colourings of graphs without small degree vertices ⋮ Star chromatic number of some graph products ⋮ The square chromatic number of the torus ⋮ A survey on packing colorings ⋮ Average distance colouring of graphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ \(L(p,q)\)-labeling of sparse graphs ⋮ Distant total sum distinguishing index of graphs ⋮ 2-distance colorings of integer distance graphs ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ On colorings of graph fractional powers ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ Distant sum distinguishing index of graphs ⋮ The complexity of frugal colouring ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ A distance-labelling problem for hypercubes ⋮ Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid ⋮ The \(k\)-distance chromatic number of trees and cycles ⋮ The distance coloring of graphs ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ On \(d_2\)-coloring of certain families of graphs ⋮ On the connectivity of k-distance graphs ⋮ 2-Distance chromatic number of some graph products ⋮ A characterization of graphs with regular distance-2 graphs ⋮ 2-distance colorings of some direct products of paths and cycles ⋮ Homogeneous colourings of graphs
Cites Work
- Acyclic and \(k\)-distance coloring of the grid
- On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- A bound on the chromatic number of the square of a planar graph
- Drawing Graphs in the Plane with High Resolution
- On the total coloring of planar graphs.
- Distant Vertex Partitions of Graphs
- Coloring the square of a planar graph
- Distance Coloring of the Hexagonal Lattice
- Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes
- 25 pretty graph colouring problems
- Local structures in plane maps and distance colourings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey on the distance-colouring of graphs
