scientific article; zbMATH DE number 3308991
From MaRDI portal
Publication:5589872
Cited in
(25)- Chromatic numbers of exact distance graphs
- The subchromatic number of a graph
- On the strong chromatic index of cyclic multigraphs
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
- Further results on 2-distance coloring of graphs
- 2-distance list ( +2)-coloring of planar graphs with girth at least 10
- Graph \(r\)-hued colorings -- a survey
- Exact square coloring of certain classes of graphs: complexity and algorithms
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- The k-distance chromatic number of trees and cycles
- Colouring exact distance graphs of chordal graphs
- 2-distance colorings of some direct products of paths and cycles
- A survey on the distance-colouring of graphs
- Exact square coloring of subcubic planar graphs
- Injective coloring of graphs revisited
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
- Exact square coloring of graphs resulting from some graph operations and products
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
- Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes
- Eigenvalue bounds for the quantum chromatic number of graph powers
- Injective colorings of Sierpiński-like graphs and Kneser graphs
- On the k-independence number of graph products
- 2-distance 4-coloring of planar subcubic graphs with girth at least 21
- The distance coloring of graphs
- The square chromatic number of the torus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589872)
