On (k,ℓ)-Leaf Powers
From MaRDI portal
Publication:3525598
Recommendations
Cited in
(21)- Some remarks about leaf roots
- Boxicity of leaf powers
- On graph powers for leaf-labeled trees
- Recognition of linear and star variants of leaf powers is in P
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Simplicial powers of graphs
- Characterising \((k,\ell )\)-leaf powers
- Computing optimal leaf roots of chordal cographs in linear time
- Linear time construction of 5-phylogenetic roots for tree chordal graphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Structure and linear-time recognition of 4-leaf powers
- Parameterized leaf power recognition via embedding into graph products
- On leap indices of CNCk[n] by using line operator on its subdivision
- The complete inclusion structure of leaf power classes
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- On k- Versus (k + 1)-Leaf Powers
- Simplicial Powers of Graphs
- Parameterized leaf power recognition via embedding into graph products
- 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: On (k,ℓ)-Leaf Powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525598)