Colorings at minimum cost

DOI10.1016/j.disc.2009.03.038zbMath1236.05076OpenAlexW2034968868MaRDI QIDQ960968

Dieter Mitsche, Robert Berke

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.038

zbMATH Keywords

bounded degree graphsgraph labelingsgraph colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• On the cost-chromatic number of graphs
• \(T\)-colorings and \(T\)-edge spans of graphs

This page was built for publication: Colorings at minimum cost