Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Computing roots of graphs is hard
Discrete Applied Mathematics
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Algorithms for Square Roots of Graphs
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
On graph powers for leaf-labeled trees
Journal of Algorithms
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
Strictly chordal graphs are leaf powers
Journal of Discrete Algorithms
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
Linear-Time algorithms for tree root problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Extending the tractability border for closest leaf powers
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
Ptolemaic graphs and interval graphs are leaf powers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
| Hi-index | 0.00 |
The k-power graph of a graph G is the graph in which two vertices are adjacent if and only if there is a path between them in G of length at most k. We show that (1.) the k-power graph of a tree has NLC-width at most k+2 and clique-width at most k+2+max(⌊k/2⌋-1, 0), (2.) the k-leaf-power graph of a tree has NLC-width at most k and clique-width at most k+max(⌊k/2⌋-2, 0), and (3.) the k-power graph of a graph of tree-width l has NLC-width at most (k+1)l+1 - 1 and clique-width at most 2 ċ (k + 1)l+1 - 2.