Ordered Coloring Grids and Related Graphs

DOI10.1007/978-3-642-11476-2_4zbMath1274.68269OpenAlexW2108189610MaRDI QIDQ3408158

Michael Lampis, Valia Mitsou, Amotz Bar-Noy, Panagiotis Cheilaris, Stathis Zachos

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_4

zbMATH Keywords

vertex rankinggrid graphconflict-free coloringordered coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Graph unique-maximum and conflict-free colorings

Cites Work

• Unnamed Item
• Optimal node ranking of trees
• Local optimization on graphs
• Ordered colourings
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Conflict-free coloring of points and simple regions in the plane
• The Role of Elimination Trees in Sparse Factorization
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Deterministic conflict-free coloring for intervals
• Online Conflict‐Free Coloring for Intervals
• Conflict-Free Colorings of Rectangles Ranges

This page was built for publication: Ordered Coloring Grids and Related Graphs