Clique and anticlique partitions of graphs

DOI10.1007/3-540-62559-3_7zbMATH Open1539.05119MaRDI QIDQ6550534

Krzysztof Bryś, Zbigniew Lonc

Publication date: 5 June 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

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