scientific article; zbMATH DE number 867710

MaRDI QIDQ4873827zbMATH OpenFDO

Authors Joan Feigenbaum

Publication date 22 April 1996

zbMATH Keywords

complexity classcomputational complexityirreducible graphslexicographic productlexicographically factorable extensionsNP-hard

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Lexicographic product of extendable graphs
• On Factorable Extensions and Subgraphs of Prime Graphs
• On matching extendability of lexicographic products
• On the complexity of some problems related to graph extensions
• Minimum cycle bases of lexicographic products

Cited in

(3)

• Equipartitions of graphs
• On Factorable Extensions and Subgraphs of Prime Graphs
• scientific article; zbMATH DE number 7310226 (Why is no real title available?)

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