Strictly chordal graphs are leaf powers
From MaRDI portal
Publication:866539
DOI10.1016/j.jda.2005.06.005zbMath1108.92031OpenAlexW2049045223MaRDI QIDQ866539
Guo-Hui Lin, Gui Ying Yan, W. Sean Kennedy
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
Problems related to evolution (92D15) Applications of graph theory (05C90) Computational methods for problems pertaining to biology (92-08)
Related Items (24)
New results on pairwise compatibility graphs ⋮ Ptolemaic and planar cover-incomparability graphs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ The Clique-Width of Tree-Power and Leaf-Power Graphs ⋮ The 3-Steiner Root Problem ⋮ Strictly chordal graphs: structural properties and integer Laplacian eigenvalues ⋮ Boxicity of leaf powers ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ New results on Ptolemaic graphs ⋮ Rooted directed path graphs are leaf powers ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Non-inclusion and other subclasses of chordal graphs ⋮ On graphs that are not PCGs ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ The NLC-width and clique-width for powers of graphs of bounded tree-width ⋮ Simplicial powers of graphs ⋮ The complete inclusion structure of leaf power classes ⋮ A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers ⋮ ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS ⋮ Parameterized leaf power recognition via embedding into graph products ⋮ Simplicial Powers of Graphs ⋮ On k- Versus (k + 1)-Leaf Powers
Cites Work
This page was built for publication: Strictly chordal graphs are leaf powers
