Recognizing leaf powers and pairwise compatibility graphs is NP-complete

DOI10.1137/1.9781611978971.219MaRDI QIDQ7294763zbMATH OpenFDO

Authors Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye

Publication date 13 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978971.219

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Recognizing leaf powers and pairwise compatibility graphs is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294763)