Structure and linear time recognition of 3-leaf powers
From MaRDI portal
Recommendations
- Structure and linear-time recognition of 4-leaf powers
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Recognition of linear and star variants of leaf powers is in P
- Linear complexity of ternary sequences formed on the basis of power residue classes
- A polynomial kernel for 3-leaf power deletion
- scientific article; zbMATH DE number 7559376
- On k- Versus (k + 1)-Leaf Powers
- Characterization and Recognition of Partial 3-Trees
- Characterising \((k,\ell )\)-leaf powers
- On the power of border of depth-3 arithmetic circuits
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?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms and Computation
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- Graph Classes: A Survey
- On graph powers for leaf-labeled trees
- Some remarks about leaf roots
Cited in
(44)- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- On the pairwise compatibility property of some superclasses of threshold graphs
- The complete inclusion structure of leaf power classes
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- The scattering number of strictly chordal graphs: linear time determination
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
- Boxicity of leaf powers
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
- Exact leaf powers
- 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
- The 3-Steiner Root Problem
- Closest 4-leaf power is fixed-parameter tractable
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- On coloring problems with local constraints
- 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
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- Maximal determinants of combinatorial matrices
- Pairwise compatibility graphs: complete characterization for wheels
- Rooted directed path graphs are leaf powers
- Some remarks about leaf roots
- Polynomial kernels for 3-leaf power graph modification problems
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- Simplicial powers of graphs
- Grammars and clique-width bounds from split decompositions
- Pairwise compatibility graphs: a survey
- Path-bicolorable graphs
- Characterising \((k,\ell )\)-leaf powers
- Structure and linear-time recognition of 4-leaf powers
- Linear time construction of 5-phylogenetic roots for tree chordal graphs
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
- Recognition of linear and star variants of leaf powers is in P
- A polynomial kernel for 3-leaf power deletion
- Polynomial kernels for 3-leaf power graph modification problems
- Path-bicolorable graphs. (Extended abstract)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
This page was built for publication: Structure and linear time recognition of 3-leaf powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844175)
