Strictly chordal graphs are leaf powers
From MaRDI portal
Publication:866539
DOI10.1016/J.JDA.2005.06.005zbMATH Open1108.92031OpenAlexW2049045223MaRDI QIDQ866539FDOQ866539
Authors: W. Sean Kennedy, Guohui Lin, Guiying Yan 
Publication date: 14 February 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.06.005
Recommendations
Applications of graph theory (05C90) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Introduction to algorithms
- Graph Classes: A Survey
- Computing roots of graphs is hard
- Algorithms for Square Roots of Graphs
- Title not available (Why is that?)
- On graph powers for leaf-labeled trees
- Tree Powers
- Title not available (Why is that?)
- On the complexity of join dependencies
- Recent Advances in Constraints
Cited In (27)
- On graphs that are not PCGs
- Boxicity of leaf powers
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Simplicial powers of graphs
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- The 3-Steiner Root Problem
- Ptolemaic and planar cover-incomparability graphs
- Toughness and Hamiltonicity of strictly chordal graphs
- Non-inclusion and other subclasses of chordal graphs
- Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
- Computing optimal leaf roots of chordal cographs in linear time
- Multicore graphs: characterization and properties
- Characterising \((k,\ell )\)-leaf powers
- New results on pairwise compatibility 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
- On strongly chordal graphs that are not leaf powers
- Parameterized leaf power recognition via embedding into graph products
- On the pairwise compatibility property of some superclasses of threshold graphs
- Rooted directed path graphs are leaf powers
- New results on Ptolemaic graphs
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
This page was built for publication: Strictly chordal graphs are leaf powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866539)
