Tree Powers
From MaRDI portal
Recommendations
Cited in
(25)- Closest 4-leaf power is fixed-parameter tractable
- Pairwise compatibility graphs
- Trees with power-like height dependent weight
- On pairwise compatibility graphs having Dilworth number k
- Linear-time algorithms for tree root problems
- Complexity of finding graph roots with girth conditions
- Strongly simplicial vertices of powers of trees
- On pairwise compatibility graphs having Dilworth number two
- The 3-Steiner Root Problem
- Distance three labelings of trees
- On tree roots of graphs
- On the two largest distance eigenvalues of graph powers
- On the strength of some trees
- Complexity of the Packing Coloring Problem for Trees
- Computing and Combinatorics
- Linear-Time Algorithms for Tree Root Problems
- Polynomial kernels for 3-leaf power graph modification problems
- On the complexity of distance-\(d\) independent set reconfiguration
- On the complexity of distance-\(d\) independent set reconfiguration
- Algebraic bounds for the independence and chromatic number of graph powers
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
- Computing phylogenetic roots with bounded degrees and errors is NP-complete
- Strictly chordal graphs are leaf powers
- The square of a block graph
- Exact leaf powers
This page was built for publication: Tree Powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217303)
