Parameterized Leaf Power Recognition via Embedding into Graph Products
From MaRDI portal
Publication:5009478
DOI10.4230/LIPIcs.IPEC.2018.16OpenAlexW2895577547MaRDI QIDQ5009478
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1810.02452
monadic second-order logicphylogenetic treefixed-parameter tractabilitystrong product of graphsCourcelle's theoremleaf power
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized leaf power recognition via embedding into graph products
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- Rooted directed path graphs are leaf powers
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- S-functions for graphs
- On the planar split thickness of graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Handle-rewriting hypergraph grammars
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Some remarks about leaf roots
- Nonserial dynamic programming
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On Graph Powers for Leaf-Labeled Trees
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- The 3-Steiner Root Problem
- Graph minors. II. Algorithmic aspects of tree-width
- Smallest-last ordering and clustering and graph coloring algorithms
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Structure and linear-time recognition of 4-leaf powers
- Practical Access to Dynamic Programming on Tree Decompositions
- Computing crossing numbers in quadratic time
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- On k- Versus (k + 1)-Leaf Powers
- Algorithms and Computation
- Graph-Theoretic Concepts in Computer Science
