Characterising (k, )-leaf powers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4077265 (Why is no real title available?)
- scientific article; zbMATH DE number 165077 (Why is no real title available?)
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- A note on the metric properties of trees
- Algorithms and Computation
- Distance-hereditary graphs
- Efficient graph representations
- Error compensation in leaf power problems
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Leaf Powers and Their Properties: Using the Trees
- Linear-time recognition of circular-arc graphs
- Neighborhood subtree tolerance graphs
- On (k,ℓ)-Leaf Powers
- On graph powers for leaf-labeled trees
- On k- Versus (k + 1)-Leaf Powers
- On metric properties of certain clique graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Representing a concept lattice by a graph
- Simplicial Powers of Graphs
- Some remarks about leaf roots
- Strictly chordal graphs are leaf powers
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- The 3-Steiner Root Problem
Cited in
(22)- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- The scattering number of strictly chordal graphs: linear time determination
- Mim-width. III. Graph powers and generalized distance domination problems
- Boxicity of leaf powers
- On k- Versus (k + 1)-Leaf Powers
- Simplicial Powers of Graphs
- On graph powers for leaf-labeled trees
- Strictly chordal graphs are leaf powers
- Non-inclusion and other subclasses of chordal graphs
- Computing optimal leaf roots of chordal cographs in linear time
- On (k,ℓ)-Leaf Powers
- Rooted directed path graphs are leaf powers
- Some remarks about leaf roots
- Pairwise compatibility graphs: a survey
- Structure and linear time recognition of 3-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Recognition of linear and star variants of leaf powers is in P
- Leaf Powers and Their Properties: Using the Trees
- On basic chordal graphs and some of its subclasses
- On graphs that are not PCGs
This page was built for publication: Characterising \((k,\ell )\)-leaf powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968117)
