2-Distance Coloring of Sparse Graphs
From MaRDI portal
Publication:2930038
DOI10.1002/jgt.21782zbMath1304.05042OpenAlexW2148916877MaRDI QIDQ2930038
No author found.
Publication date: 17 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01233451/file/blp11.pdf
No records found.
No records found.
Related Items (18)
Facial incidence colorings of embedded multigraphs ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ List 2-distance coloring of planar graphs with girth five ⋮ 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Hypergraph incidence coloring ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ 2-distance colorings of integer distance graphs ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ List \(r\)-dynamic coloring of graphs with small maximum average degree ⋮ An introduction to the discharging method via graph coloring ⋮ Finding cut-vertices in the square roots of a graph ⋮ Incidence coloring -- cold cases ⋮ The \(k\)-distance chromatic number of trees and cycles ⋮ List coloring the square of sparse graphs with large degree ⋮ A characterization of graphs with regular distance-2 graphs ⋮ Incidence coloring of graphs with high maximum average degree
This page was built for publication: 2-Distance Coloring of Sparse Graphs
