Anticoloring of a family of grid graphs

DOI10.1016/j.disopt.2008.02.001zbMath1154.05028OpenAlexW2034665826MaRDI QIDQ937411

Shira Zucker, Daniel Berend, Ephraim Korach

Publication date: 15 August 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.02.001

zbMATH Keywords

algorithmgraphCayley graphcombinatorial optimizationgraph anticoloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Tabu search for the BWC problem ⋮ Anticoloring and separation of graphs ⋮ Anticoloring of the rook's graph ⋮ A Reduction of the Anticoloring Problem to Connected Graphs

Cites Work

• Splitting trees
• Reduced constants for simple cycle graph separation
• A Separator Theorem for Planar Graphs
• Planar Separators
• Unnamed Item
• Unnamed Item

This page was built for publication: Anticoloring of a family of grid graphs