2-distance coloring of sparse graphs

DOI10.1002/JGT.21782MaRDI QIDQ6486785zbMATH OpenOpenAlexFDO

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

Publication date 17 November 2014

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-01233451/file/blp11.pdf

zbMATH Keywords

planar graph2-distance coloringmaximum average degreesparse graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• 2-distance coloring of sparse graphs
• Distance-two coloring of sparse graphs
• 2-distance coloring of sparse planar graphs
• 2-distance coloring of sparse planar graphs
• The list 2-distance coloring of sparse graphs
• Near-proper vertex 2-colorings of sparse graphs
• 2-distance colorings of integer distance graphs
• Further results on 2-distance coloring of graphs
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs

Cites work

• scientific article; zbMATH DE number 5279355 (Why is no real title available?)
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-distance coloring of sparse graphs
• 2-distance coloring of sparse planar graphs
• Choosability conjectures and multicircuits
• Coloring squares of planar graphs with girth six
• Counterexamples to the list square coloring conjecture
• Distance constrained labelings of planar graphs with no short cycles
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• On the maximum average degree and the oriented chromatic number of a graph
• On the total coloring of planar graphs.

Cited in

(29)

• The k-distance chromatic number of trees and cycles
• Facial incidence colorings of embedded multigraphs
• Incidence coloring of outer-1-planar graphs
• A characterization of graphs with regular distance-2 graphs
• Distance-2 Coloring in the CONGEST Model
• List r-hued chromatic number of graphs with bounded maximum average degrees
• List r-dynamic coloring of graphs with small maximum average degree
• 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
• List 2-distance coloring of graphs with maximum degree 5
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
• Incidence coloring of graphs with high maximum average degree
• Coloring the square of a sparse graph G with almost (G) colors
• List coloring the square of sparse graphs with large degree
• Coloring the square of graphs whose maximum average degree is less than 4
• Incidence coloring -- cold cases
• 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
• Proper additive choice number of planar graphs
• The list 2-distance coloring of sparse graphs
• Graph \(r\)-hued colorings -- a survey
• Finding cut-vertices in the square roots of a graph
• 2-distance list ( +2)-coloring of planar graphs with girth at least 10
• List 2-distance coloring of planar graphs with girth five
• Hypergraph incidence coloring
• An introduction to the discharging method via graph coloring
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• 2-distance 4-coloring of planar subcubic graphs with girth at least 21
• 2-distance colorings of integer 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 Q6486785)