scientific article; zbMATH DE number 1533810

From MaRDI portal
Publication:4517020





The author describes a class of chordal graphs (unoriented graphs) for which many NP-complete problems have polynomial complexity. Relations of the class of chordal graphs to other classes are studied. For the entire collection see [Zbl 0944.00028].











This page was built for publication:

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