Parameterized leaf power recognition via embedding into graph products (Q786044): Difference between revisions

@@ Property / OpenAlex ID @@
+W2950378209
@@ Property / OpenAlex ID: W2950378209 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Practical Access to Dynamic Programming on Tree Decompositions
+Normal rank
@@ Property / cites work @@
+Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Contribution to nonserial dynamic programming
@@ Property / cites work: Contribution to nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Ptolemaic Graphs and Interval Graphs Are Leaf Powers
+Normal rank
@@ Property / cites work @@
+Rooted directed path graphs are leaf powers
@@ Property / cites work: Rooted directed path graphs are leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and linear time recognition of 3-leaf powers
+Normal rank
@@ Property / cites work @@
+A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
+Normal rank
@@ Property / cites work @@
+Structure and linear-time recognition of 4-leaf powers
+Normal rank
@@ Property / cites work @@
+On k- Versus (k + 1)-Leaf Powers
@@ Property / cites work: On k- Versus (k + 1)-Leaf Powers / rank @@
+Normal rank
@@ Property / cites work @@
+Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
+Normal rank
@@ Property / cites work @@
+The 3-Steiner Root Problem
@@ Property / cites work: The 3-Steiner Root Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for tree root problems
@@ Property / cites work: Linear-time algorithms for tree root problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Phylogenetic Roots with Bounded Degrees and Errors
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4353558
@@ Property / cites work: Q4353558 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+The 4-Steiner Root problem
@@ Property / cites work: The 4-Steiner Root problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding cut-vertices in the square roots of a graph
+Normal rank
@@ Property / cites work @@
+On the planar split thickness of graphs
@@ Property / cites work: On the planar split thickness of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / cites work @@
+Finding Cactus Roots in Polynomial Time
@@ Property / cites work: Finding Cactus Roots in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+The Clique-Width of Tree-Power and Leaf-Power Graphs
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-width, parse trees, and monadic second-order logic for matroids.
+Normal rank
@@ Property / cites work @@
+Strictly chordal graphs are leaf powers
@@ Property / cites work: Strictly chordal graphs are leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite roots of graphs
@@ Property / cites work: Bipartite roots of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+Hardness Results and Efficient Algorithms for Graph Powers
+Normal rank
@@ Property / cites work @@
+On Graph Powers for Leaf-Labeled Trees
@@ Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks about leaf roots
@@ Property / cites work: Some remarks about leaf roots / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+The square of a block graph
@@ Property / cites work: The square of a block graph / rank @@
+Normal rank