Graph reduction in the construction of minimal clique cover

DOI10.4213/MVK63MaRDI QIDQ4959050zbMATH OpenOpenAlexFDO

Authors P. V. Roldugin

Publication date 15 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk63

zbMATH Keywords

cliquesclasses of graphsgraph coverings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 7310192
• Data reduction and exact algorithms for clique cover
• Data reduction, exact, and heuristic algorithms for clique cover
• scientific article; zbMATH DE number 1545697
• Assignment-minimum clique coverings

Cites work

• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• A simple lower bound on edge coverings by cliques
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Data reduction, exact, and heuristic algorithms for clique cover

Cited in

(9)

• scientific article; zbMATH DE number 15860 (Why is no real title available?)
• Data reduction and exact algorithms for clique cover
• Methods of finding all minimum coverings of a graph by cliques
• scientific article; zbMATH DE number 1545697 (Why is no real title available?)
• Assignment-minimum clique coverings
• Reducing graph coloring to clique search
• Data reduction, exact, and heuristic algorithms for clique cover
• The inductive graph dimension from the minimum edge clique cover
• Extremal and asymptotic properties of irreducible coverings of graphs by cliques

This page was built for publication: Graph reduction in the construction of minimal clique cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959050)