Tree Powers
From MaRDI portal
Publication:4217303
DOI10.1006/jagm.1998.9999zbMath0919.68055MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Complexity of the Packing Coloring Problem for Trees, Distance three labelings of trees, On the two largest distance eigenvalues of graph powers, Polynomial kernels for 3-leaf power graph modification problems, 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, Closest 4-leaf power is fixed-parameter tractable, Pairwise compatibility graphs, 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