Structure and linear-time recognition of 4-leaf powers
From MaRDI portal
Publication:4962769
DOI10.1145/1435375.1435386zbMath1451.05040OpenAlexW2087058366MaRDI QIDQ4962769
R. Sritharan, Andreas Brandstädt, Van Bang Le
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1435375.1435386
Related Items (25)
Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ New results on pairwise compatibility graphs ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Recognition of linear and star variants of leaf powers is in P ⋮ A polynomial kernel for 3-leaf power deletion ⋮ A characterization of line graphs that are squares of graphs ⋮ Recognizing k -Leaf Powers in Polynomial Time, for Constant k ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ The Clique-Width of Tree-Power and Leaf-Power Graphs ⋮ Complexity of finding graph roots with girth conditions ⋮ Boxicity of leaf powers ⋮ Parameterized Leaf Power Recognition via Embedding into Graph Products ⋮ On the two largest distance eigenvalues of graph powers ⋮ The square of a block graph ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Exact leaf powers ⋮ Unnamed Item ⋮ 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 ⋮ 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
This page was built for publication: Structure and linear-time recognition of 4-leaf powers
