2-distance coloring of sparse graphs

zbMATH Open1274.05145MaRDI QIDQ2857337FDOQ2857337

Authors: Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou 

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311000965

Recommendations

• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
• 2-Distance Coloring of Sparse Graphs
• 2-distance coloring of sparse planar graphs
• The list 2-distance coloring of sparse graphs
• 2-distance coloring of sparse planar graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

• 2-distance coloring of sparse planar graphs
• Choosability conjectures and multicircuits
• Title not available (Why is that?)
• List-Coloring Squares of Sparse Subcubic Graphs
• Title not available (Why is that?)

Cited In (14)

• The \(k\)-distance chromatic number of trees and cycles
• 2-Distance Coloring of Sparse Graphs
• Title not available (Why is that?)
• Distance-2 Coloring in the CONGEST Model
• Title not available (Why is that?)
• Distance-two coloring of sparse graphs
• On 1-improper 2-coloring of sparse graphs
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
• Vertex colorings with a distance restriction
• On incidence coloring conjecture in Cartesian products of graphs
• 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
• Two-distance vertex-distinguishing index of sparse subcubic graphs
• The list 2-distance coloring of sparse graphs
• Special study in \((2,3)\)-distance coloring and \((2,3)\)-distance graphs

This page was built for publication: 2-distance coloring of sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857337)