A characterization for a set of partial partitions to define an \(X\)-tree

DOI10.1016/S0012-365X(01)00174-1zbMath1032.05033OpenAlexW2014831817MaRDI QIDQ1598797

Charles Semple, Mike A. Steel

Publication date: 28 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00174-1

zbMATH Keywords

treechordal graphpartition intersection graphs

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Minimum Average Distance Clique Trees ⋮ Recovering trees from well-separated multi-state characters. ⋮ Unique Perfect Phylogeny Is NP-Hard ⋮ Tree reconstruction from multi-state characters ⋮ Identifying phylogenetic trees ⋮ Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters

This page was built for publication: A characterization for a set of partial partitions to define an \(X\)-tree