On Distance Coloring

DOI10.1007/978-3-642-29485-3_18MaRDI QIDQ2897959zbMATH OpenOpenAlexFDO

Authors Alexa Sharp

Publication date 16 July 2012

Published in Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29485-3_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 2201392
• A survey on the distance-colouring of graphs
• The distance coloring of graphs
• On distance graph coloring problems
• Coloring of n-dimensional distance graphs
• Coloring distance graphs: a few answers and many questions
• Colorings of distance graphs
• Coloring distance graphs on the plane
• On distance edge-colourings and matchings
• Coloring of distance graphs with intervals as distance sets

Cited in

(4)

• Distance Coloring
• Vertex colorings with a distance restriction
• Dichotomy for coloring of dart graphs
• Dichotomies properties on computational complexity of S-packing coloring problems

This page was built for publication: On Distance Coloring

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