Structure and linear-time recognition of 4-leaf powers
From MaRDI portal
Publication:4962769
Recommendations
Cited in
(30)- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- On the pairwise compatibility property of some superclasses of threshold graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Boxicity of leaf powers
- Exact leaf powers
- Complexity of finding graph roots with girth conditions
- Parameterized leaf power recognition via embedding into graph products
- On k- Versus (k + 1)-Leaf Powers
- Simplicial Powers of Graphs
- On graph powers for leaf-labeled trees
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- Parameterized leaf power recognition via embedding into graph products
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Computing optimal leaf roots of chordal cographs in linear time
- On (k,ℓ)-Leaf Powers
- A characterization of line graphs that are squares of graphs
- Pairwise compatibility graphs: complete characterization for wheels
- New results on pairwise compatibility graphs
- Some remarks about leaf roots
- Polynomial kernels for 3-leaf power graph modification problems
- Simplicial powers of graphs
- Pairwise compatibility graphs: a survey
- Structure and linear time recognition of 3-leaf powers
- Characterising \((k,\ell )\)-leaf powers
- Recognition of linear and star variants of leaf powers is in P
- On the two largest distance eigenvalues of graph powers
- A polynomial kernel for 3-leaf power deletion
- The square of a block graph
This page was built for publication: Structure and linear-time recognition of 4-leaf powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962769)
