Recommendations
Cites work
- scientific article; zbMATH DE number 3974987 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- A note on the decomposition of graphs into isomorphic matchings
- Decomposition of large uniform hypergraphs
- Delta-system decompositions of graphs
- NP-completeness of graph decomposition problems
Cited in
(14)- Clique and anticlique partitions of graphs
- On the partition and coloring of a graph by cliques
- Clique versus independent set
- scientific article; zbMATH DE number 1472140 (Why is no real title available?)
- scientific article; zbMATH DE number 3872703 (Why is no real title available?)
- Edge clique partition of \(K _{4}\)-free and planar graphs
- scientific article; zbMATH DE number 4063150 (Why is no real title available?)
- Graph partition into small cliques
- scientific article; zbMATH DE number 970807 (Why is no real title available?)
- Partitions of graphs into one or two independent sets and cliques
- A note on the computational complexity of graph vertex partition
- scientific article; zbMATH DE number 1750103 (Why is no real title available?)
- Antitwins in partitionable graphs
- scientific article; zbMATH DE number 3999981 (Why is no real title available?)
This page was built for publication: Clique and anticlique partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584251)