Some remarks about leaf roots
From MaRDI portal
Publication:2497485
DOI10.1016/J.DISC.2006.03.030zbMATH Open1095.68087OpenAlexW1965269869MaRDI QIDQ2497485FDOQ2497485
Authors: Dieter Rautenbach 
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.030
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (25)
- Title not available (Why is that?)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- A polynomial kernel for 3-leaf power deletion
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Exact leaf powers
- Simplicial powers of graphs
- Pairwise compatibility graphs: a survey
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- \(n\)-leaf and star \(n\)-leaf
- Characterising \((k,\ell )\)-leaf powers
- Maximal determinants of combinatorial matrices
- Linear time construction of 5-phylogenetic roots for tree chordal graphs
- Closest 4-leaf power is fixed-parameter tractable
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Parameterized leaf power recognition via embedding into graph products
- 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
- 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
- On extremal leaf status and internal status
- Pairwise compatibility graphs: complete characterization for wheels
This page was built for publication: Some remarks about leaf roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497485)
