Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete

From MaRDI portal
















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 Q7199629)