scientific article; zbMATH DE number 3872703

MaRDI QIDQ3339304zbMATH OpenFDO

Authors Andreas Brandstädt

Publication date 1984

zbMATH Keywords

cliquesgraph partitioningindependent setspolynomial timeundirected graphupper bounds

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Partitions of graphs into one or two independent sets and cliques
• Generalized partitions of graphs
• scientific article; zbMATH DE number 3963195
• Clique and anticlique partitions of graphs
• On partition graphs

Cited in

(10)

• Clique and anticlique partitions of graphs
• Partitions of graphs into one or two independent sets and cliques
• On partition graphs
• scientific article; zbMATH DE number 3963195 (Why is no real title available?)
• scientific article; zbMATH DE number 4031746 (Why is no real title available?)
• scientific article; zbMATH DE number 1472140 (Why is no real title available?)
• On the complexity of finding a potential community
• Equitable partition of graphs into independent sets and cliques
• Clique and anticlique partitions of graphs
• Restrictions of graph partition problems. I

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