Ordered coloring of grids and related graphs
From MaRDI portal
Publication:442258
DOI10.1016/j.tcs.2012.04.036zbMath1246.05052OpenAlexW2129503085MaRDI QIDQ442258
Panagiotis Cheilaris, Valia Mitsou, Amotz Bar-Noy, Michael Lampis, Stathis Zachos
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.036
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Stathis Zachos at 70! ⋮ Uniqueness and minimal obstructions for tree-depth ⋮ On 1-uniqueness and dense critical graphs for tree-depth
Cites Work
- Optimal node ranking of trees
- Local optimization on graphs
- Algorithmic graph theory and perfect graphs
- Ordered colourings
- The Role of Elimination Trees in Sparse Factorization
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Listing all Minimal Separators of a Graph
- Rankings of Graphs
This page was built for publication: Ordered coloring of grids and related graphs