The clique-partitioning problem

DOI10.1016/0898-1221(91)90001-KzbMath0731.05028OpenAlexW2076193235MaRDI QIDQ807637

Tariq Samad, Jayaram Bhasker

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90001-k

zbMATH Keywords

clique-partitioning a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Balancing stability and efficiency in team formation as a generalized roommate problem, Coherent network partitions: characterizations with cographs and prime graphs, Coherent network partitions, Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs

Cites Work

• Minimal clique partitions and pairwise balanced designs
• A practical approach to the chromatic partition problem
• Clique Covering of Graphs IV. Algorithms
• A graph coloring algorithm for large scheduling problems
• Clique coverings of graphs V: maximal-clique partitions
• New methods to color the vertices of a graph
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item