Decompositions of leaf-colored binary trees

DOI10.1006/aama.1993.1001zbMath0777.05047OpenAlexW1997510318MaRDI QIDQ1802339

Mike A. Steel

Publication date: 28 November 1993

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1993.1001

zbMATH Keywords

decompositionbinary treesevolutionary treeMenger's theoremcut of trees

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On weighted multiway cuts in trees ⋮ Links between maximum likelihood and maximum parsimony under a simple model of site substitution ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson

This page was built for publication: Decompositions of leaf-colored binary trees