Characterising (k, )-leaf powers
From MaRDI portal
Publication:968117
DOI10.1016/J.DAM.2009.09.008zbMATH Open1225.05079OpenAlexW2057773519MaRDI QIDQ968117FDOQ968117
Authors: 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
Recommendations
treesrecognition algorithmsblock graphsstrictly chordal graphscharacterisations\((k,\ell)\)-leaf powers\(k\)-leaf powers
Cites Work
- A note on the metric properties of trees
- Graph Classes: A Survey
- Efficient graph representations
- Linear-time recognition of circular-arc graphs
- Title not available (Why is that?)
- Distance-hereditary graphs
- On metric properties of certain clique graphs
- Title not available (Why is that?)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Neighborhood subtree tolerance graphs
- 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
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- 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
- Structure and linear time recognition of 3-leaf powers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and Computation
- Strictly chordal graphs are leaf powers
- Representing a concept lattice by a graph
- Leaf Powers and Their Properties: Using the Trees
Cited In (23)
- Mim-width. III. Graph powers and generalized distance domination problems
- Some remarks about leaf roots
- On graphs that are not PCGs
- Boxicity of leaf powers
- Recognition of linear and star variants of leaf powers is in P
- On graph powers for leaf-labeled trees
- Characterizing star-PCGs
- Pairwise compatibility graphs: a survey
- On basic chordal graphs and some of its subclasses
- On (k,ℓ)-Leaf Powers
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- The scattering number of strictly chordal graphs: linear time determination
- Non-inclusion and other subclasses of chordal graphs
- Structure and linear-time recognition of 4-leaf powers
- Towards a characterization of leaf powers by clique arrangements
- Leaf Powers and Their Properties: Using the Trees
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- On k- Versus (k + 1)-Leaf Powers
- Simplicial Powers of Graphs
- Structure and linear time recognition of 3-leaf powers
- Rooted directed path graphs are leaf powers
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Strictly chordal graphs are leaf powers
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)
