Representing non-crossing cuts by phylogenetic trees

DOI10.5614/ejgta.2021.9.2.20zbMath1482.05161OpenAlexW3206353408MaRDI QIDQ5061705

Thomas Lange

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.20

zbMATH Keywords

phylogenetic treeedge-bipartitionpairwise laminar cutset

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• An algebraic metric for phylogenetic trees
• Enumerating phylogenetic trees with multiple labels
• Comparison of phylogenetic trees
• On two minimax theorems in graph
• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• Strong Covering of a Bipartite Graph

This page was built for publication: Representing non-crossing cuts by phylogenetic trees