The distance coloring of graphs
From MaRDI portal
Publication:741239
DOI10.1007/s10114-014-3238-9zbMath1297.05088arXiv1212.1029OpenAlexW1971442162MaRDI QIDQ741239
Publication date: 11 September 2014
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1029
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (4)
Painting squares in \(\Delta^2-1\) shades ⋮ Graph \(r\)-hued colorings -- a survey ⋮ A Brooks-like result for graph powers ⋮ The complexity of frugal colouring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic and \(k\)-distance coloring of the grid
- Regular graphs with excess one
- A strengthening of Brooks' theorem
- A special \(k\)-coloring for a connected \(k\)-chromatic graph
- A survey on the distance-colouring of graphs
- A bound on the chromatic number of the square of a planar graph
- List Colouring Squares of Planar Graphs
- Distance Coloring
- List-coloring the square of a subcubic graph
- Maximum degree in graphs of diameter 2
- Distant Vertex Partitions of Graphs
- Coloring Powers of Planar Graphs
- Some maximum multigraphs and adge/vertex distance colourings
- Distance Coloring of the Hexagonal Lattice
- The Eigenvalues of a Graph and Its Chromatic Number
- Local structures in plane maps and distance colourings
This page was built for publication: The distance coloring of graphs
