scientific article; zbMATH DE number 4063150

MaRDI QIDQ3797236zbMATH OpenFDO

Authors A. S. Azarënok, V. S. Krikun

Publication date 1988

zbMATH Keywords

complexityNP-completenessn-cliquen-partite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3885943
• On the clique number of integral circulant graphs
• scientific article; zbMATH DE number 3999981
• On clique coverings of complete multipartite graphs
• Clique covering and clique partition in generalizations of line graphs
• Clique partitions and clique coverings
• scientific article; zbMATH DE number 4031729
• On a \(k\)-clique-join of a class of partitionalble graphs
• Clique and anticlique partitions of graphs
• Clique coverings and partitions of line graphs

Cited in

(1)

• Discovering cis-regulatory modules by optimizing barbecues

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