A Reduction of the Anticoloring Problem to Connected Graphs

DOI10.1016/J.ENDM.2007.01.062MaRDI QIDQ3439618zbMATH OpenOpenAlexFDO

Authors Daniel Berend, Ephraim Korach, Shira Zucker

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.062

zbMATH Keywords

combinatorial optimizationalgorithmdisconnected graphgraph anticoloring

Mathematics Subject Classification ID

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

Recommendations

• Anticoloring and separation of graphs
• Two-anticoloring of planar and related graphs
• Anticoloring of a family of grid graphs
• Anticoloring of the rook's graph
• Connected colorings of graphs.

Cites work

• Anticoloring of a family of grid graphs
• Fast separation in a graph with an excluded minor
• Semiregular automorphisms of vertex-transitive cubic graphs
• Splitting trees

Cited in

(6)

• Anticoloring and separation of graphs
• Anticoloring of the rook's graph
• Two-anticoloring of planar and related graphs
• A greedy probabilistic heuristic for graph black-and-white anticoloring
• Tabu search for the BWC problem
• Anticoloring of a family of grid graphs

This page was built for publication: A Reduction of the Anticoloring Problem to Connected Graphs

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