Exact leaf powers
- 28 June 2010
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (31-33) , 2968-2977
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Structure and linear-time recognition of 4-leaf powersACM Transactions on Algorithms, 2008
- Structure and linear time recognition of 3-leaf powersInformation Processing Letters, 2006
- Four Characters Suffice to Convexly Define a Phylogenetic TreeSIAM Journal on Discrete Mathematics, 2005
- NeST graphsDiscrete Applied Mathematics, 2002
- Tree PowersJournal of Algorithms, 1998
- Neighborhood subtree tolerance graphsDiscrete Applied Mathematics, 1993
- Tolerance graphsDiscrete Applied Mathematics, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974