scientific article; zbMATH DE number 3784633

MaRDI QIDQ3962775zbMATH OpenFDO

Authors Heinrich Mueller

Publication date 1981

zbMATH Keywords

colouring problemsdependence systemefficient approximative solvabilityindependence systemlexicographical composition of graphsnode coveringNP-completenessrestricted P-problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Programming involving graphs or networks (90C35)

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