2-distance ( + 1)-coloring of sparse graphs using the potential method

DOI10.1016/J.DISC.2024.114292MaRDI QIDQ6635121zbMATH OpenFDO

Authors Hoang La, Mickaël Montassier

Publication date 9 November 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114292

zbMATH Keywords

2-distance coloringdischarging methodpotential methodsparse graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• 2-distance coloring of sparse graphs
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
• 2-distance coloring of sparse planar graphs
• 2-distance \((\Delta+2)\)-coloring of sparse planar graphs with \(\Delta=3\)
• 2-distance list ( +2)-coloring of planar graphs with girth at least 10

Cites work

• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-distance coloring of planar graphs with girth 5
• 2-distance coloring of sparse graphs
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• An improved bound on 2-distance coloring plane graphs with girth 5
• An optimal square coloring of planar graphs
• Channel assignment with \(r\)-dynamic coloring
• Choosability of the square of a planar graph with maximum degree four
• Coloring squares of planar graphs with girth six
• Coloring the square of a \(K_{4}\)-minor free graph
• Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
• scientific article; zbMATH DE number 3265667 (Why is no real title available?)
• scientific article; zbMATH DE number 3308991 (Why is no real title available?)
• List 2-distance coloring of planar graphs without short cycles
• List 2-facial 5-colorability of plane graphs with girth at least 12
• List-coloring the square of a subcubic graph
• On 2-distance coloring of plane graphs with girth 5
• On the maximum average degree and the oriented chromatic number of a graph
• Planar graphs of girth at least five are square ( + 2)-choosable
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• The list 2-distance coloring of a graph with (G)=5
• The square of a planar cubic graph is 7-colorable

Cited in

(1)

• S-packing chromatic critical graphs

This page was built for publication: 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method

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