Splitting trees
From MaRDI portal
Publication:1356762
DOI10.1016/S0012-365X(96)00187-2zbMath0873.05036OpenAlexW4212994261MaRDI QIDQ1356762
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
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Algorithms for vertex-partitioning problems on graphs with fixed clique-width., Tabu search for the BWC problem, On the complexity of the black-and-white coloring problem on some classes of perfect graphs, Anticoloring of a family of grid graphs, Anticoloring and separation of graphs, Anticoloring of the rook's graph, A Reduction of the Anticoloring Problem to Connected Graphs
Cites Work
