On some coloring problems in grids

DOI10.1016/J.TCS.2012.10.046zbMath1257.68071OpenAlexW1968845760MaRDI QIDQ1939251

Marc Demange, Dominique de Werra

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.046

zbMATH Keywords

complexitygrid graphslist coloringprecoloring extension

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Answering conjunctive queries with inequalities ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ Open Problems on Graph Coloring for Special Graph Classes

This page was built for publication: On some coloring problems in grids