Anticoloring and separation of graphs

DOI10.1016/j.disc.2009.03.027zbMath1215.05055OpenAlexW1963673573MaRDI QIDQ960942

Shira Zucker, Daniel Berend, Ephraim Korach

Publication date: 29 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.027

zbMATH Keywords

algorithmcombinatorial optimizationplanar graphseparationdisconnected graphgraph anticoloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Tabu search for the BWC problem ⋮ Anticoloring of the rook's graph

Cites Work

• Anticoloring of a family of grid graphs
• Splitting trees
• Reduced constants for simple cycle graph separation
• A Separator Theorem for Chordal Graphs
• A Separator Theorem for Planar Graphs
• Planar Separators
• An infinite series of regular edge- but not vertex-transitive graphs
• Regular line-symmetric graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Anticoloring and separation of graphs