The Clique-Width of Tree-Power and Leaf-Power Graphs
From MaRDI portal
Publication:3508556
DOI10.1007/978-3-540-74839-7_8zbMath1141.68531OpenAlexW1538861354MaRDI QIDQ3508556
Publication date: 1 July 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_8
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Parameterized leaf power recognition via embedding into graph products
Cites Work
- Monadic second-order evaluations on tree-decomposable graphs
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- \(k\)-NLC graphs and polynomial algorithms
- Computing roots of graphs is hard
- On simple characterizations of k-trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Some remarks about leaf roots
- On Graph Powers for Leaf-Labeled Trees
- Graph minors. II. Algorithmic aspects of tree-width
- Graph Classes: A Survey
- Algorithms for Square Roots of Graphs
- Structure and linear-time recognition of 4-leaf powers
- On the Relationship Between Clique-Width and Treewidth
- Linear-Time Algorithms for Tree Root Problems
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
This page was built for publication: The Clique-Width of Tree-Power and Leaf-Power Graphs
