Characterising \((k,\ell )\)-leaf powers
From MaRDI portal
Publication:968117
DOI10.1016/j.dam.2009.09.008zbMath1225.05079MaRDI QIDQ968117
Andreas Brandstädt, Peter Wagner
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.008
trees; block graphs; recognition algorithms; strictly chordal graphs; characterisations; \((k,\ell)\)-leaf powers; \(k\)-leaf powers
Related Items
On basic chordal graphs and some of its subclasses, Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences, On graphs that are not PCGs, Pairwise Compatibility Graphs: A Survey
Cites Work
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Distance-hereditary graphs
- On metric properties of certain clique graphs
- Efficient graph representations
- Linear-time recognition of circular-arc graphs
- Neighborhood subtree tolerance graphs
- A note on the metric properties of trees
- Representing a concept lattice by a graph
- Some remarks about leaf roots
- Error compensation in leaf power problems
- On Graph Powers for Leaf-Labeled Trees
- The 3-Steiner Root Problem
- On (k,ℓ)-Leaf Powers
- Leaf Powers and Their Properties: Using the Trees
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- Graph Classes: A Survey
- Structure and linear-time recognition of 4-leaf powers
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Simplicial Powers of Graphs
- On k- Versus (k + 1)-Leaf Powers
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
