2-distance coloring of sparse graphs

MaRDI QIDQ2857337zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 6004909 (Why is no real title available?)
• scientific article; zbMATH DE number 5279355 (Why is no real title available?)
• 2-distance coloring of sparse planar graphs
• Choosability conjectures and multicircuits
• List-Coloring Squares of Sparse Subcubic Graphs

Cited in

(14)

• The k-distance chromatic number of trees and cycles
• scientific article; zbMATH DE number 6613416 (Why is no real title available?)
• 2-distance coloring of sparse graphs
• Distance-2 Coloring in the CONGEST Model
• scientific article; zbMATH DE number 844150 (Why is no real title available?)
• 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)