Decompositions of leaf-colored binary trees
From MaRDI portal
Publication:1802339
DOI10.1006/AAMA.1993.1001zbMATH Open0777.05047OpenAlexW1997510318MaRDI QIDQ1802339FDOQ1802339
Authors: Mike 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
Recommendations
Problems related to evolution (92D15) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (5)
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
- On weighted multiway cuts in trees
- Links between maximum likelihood and maximum parsimony under a simple model of site substitution
- Title not available (Why is that?)
This page was built for publication: Decompositions of leaf-colored binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802339)