Splitting trees

DOI10.1016/S0012-365X(96)00187-2MaRDI QIDQ1356762zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Nicolas Quinodoz, Alain Hertz

Publication date 8 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00187-2

zbMATH Keywords

treescoloringpolynomial algorithmchainblack-and-white coloringsplitting trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The Black-and-White Coloring Problem on Trees
• An improved algorithm for the black-and-white coloring problem on trees
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs
• On tree partitions
• The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs

Cited in

(15)

• An improved algorithm for the black-and-white coloring problem on trees
• Anticoloring and separation of graphs
• Cutting down very simple trees
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs
• Lazy tree splitting
• Anticoloring of the rook's graph
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• A greedy probabilistic heuristic for graph black-and-white anticoloring
• Tabu search for the BWC problem
• Destruction of very simple trees
• scientific article; zbMATH DE number 2065939 (Why is no real title available?)
• The Black-and-White Coloring Problem on Trees
• Anticoloring of a family of grid graphs
• The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs
• A Reduction of the Anticoloring Problem to Connected Graphs

This page was built for publication: Splitting trees

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