Two-anticoloring of planar and related graphs

MaRDI QIDQ5485315zbMATH OpenFDO

Authors Daniel Berend, Ephraim Korach, Shira Zucker

Publication date 29 August 2006

zbMATH Keywords

combinatorial optimizationalgorithmseparationgraph anticoloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Anticoloring and separation of graphs
• Anticoloring of a family of grid graphs
• A Reduction of the Anticoloring Problem to Connected Graphs
• Anticoloring of the rook's graph
• Planar graphs have two-coloring number at most 8

Cited in

(6)

• Anticoloring and separation of graphs
• Antisymmetric flows and strong oriented coloring of planar graphs
• Anticoloring of the rook's graph
• Tabu search for the BWC problem
• Anticoloring of a family of grid graphs
• A Reduction of the Anticoloring Problem to Connected Graphs

This page was built for publication: Two-anticoloring of planar and related graphs

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