Clique and anticlique partitions of graphs

DOI10.1016/S0012-365X(97)00181-7zbMath0957.05088OpenAlexW2069378581MaRDI QIDQ1584251

Krzysztof Bryś, Zbigniew Lonc

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00181-7

zbMATH Keywords

partitioncliquesindependent setsanticliques

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

A note on the computational complexity of graph vertex partition

Cites Work

• Decomposition of large uniform hypergraphs
• A note on the decomposition of graphs into isomorphic matchings
• NP-completeness of graph decomposition problems
• Delta-system decompositions of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clique and anticlique partitions of graphs