Tree Powers

DOI10.1006/jagm.1998.9999zbMath0919.68055OpenAlexW2912101389MaRDI QIDQ4217303

Derek Gordon Corneil, Paul E. Kearney

Publication date: 23 August 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.9999

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (18)

Complexity of the Packing Coloring Problem for Trees ⋮ On pairwise compatibility graphs having Dilworth number two ⋮ Computing phylogenetic roots with bounded degrees and errors is NP-complete ⋮ Strictly chordal graphs are leaf powers ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ On the complexity of distance-\(d\) independent set reconfiguration ⋮ Distance three labelings of trees ⋮ The 3-Steiner Root Problem ⋮ Complexity of finding graph roots with girth conditions ⋮ Strongly simplicial vertices of powers of trees ⋮ On the two largest distance eigenvalues of graph powers ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ The square of a block graph ⋮ Exact leaf powers ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Pairwise compatibility graphs ⋮ Linear-time algorithms for tree root problems

This page was built for publication: Tree Powers