Graph Unique-Maximum and Conflict-Free Colorings
From MaRDI portal
Publication:3562999
DOI10.1007/978-3-642-13073-1_14zbMath1284.05095OpenAlexW2937861749MaRDI QIDQ3562999
Panagiotis Cheilaris, Géza Tóth
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_14
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Graph Unique-Maximum and Conflict-Free Colorings