The following pages link to (Q2721973):
Displaying 6 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
- On graph powers for leaf-labeled trees (Q2777607) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)