Graph unique-maximum and conflict-free colorings

DOI10.1007/978-3-642-13073-1_14zbMATH Open1284.05095OpenAlexW2937861749MaRDI QIDQ3562999FDOQ3562999

Authors: 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

Recommendations

• Graph unique-maximum and conflict-free colorings
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Three colors suffice: conflict-free coloring of planar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Unique-maximum coloring of plane graphs
• Graph unique-maximum and conflict-free colorings
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

This page was built for publication: Graph unique-maximum and conflict-free colorings

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