The following pages link to Tree Powers (Q4217303):
Displaying 15 items.
- Distance three labelings of trees (Q415278) (← links)
- On the two largest distance eigenvalues of graph powers (Q503610) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- The square of a block graph (Q965949) (← links)
- Exact leaf powers (Q982668) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Pairwise compatibility graphs (Q1032039) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
