On a clique covering problem of Orlin

DOI10.1016/0012-365X(82)90085-1zbMath0485.05053OpenAlexW1981296715MaRDI QIDQ1164073

David A. Gregory, Norman J. Pullman

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90085-1

zbMATH Keywords

complete graphperfect matchingclique covering

Mathematics Subject Classification ID

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

Related Items (12)

An overview of graph covering and partitioning ⋮ Covering graphs by the minimum number of equivalence relations ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Clique Partitions of Chordal Graphs ⋮ Avoiding exponential explosion in Petri net models of control flows ⋮ Duality and perfection for edges in cliques ⋮ Clique partitions and clique coverings ⋮ Edge clique covering sum of graphs ⋮ A note on induced cycles in Kneser graphs ⋮ Biclique cover and local clique cover of graphs ⋮ Applications of edge coverings by cliques ⋮ A simple lower bound on edge coverings by cliques

Cites Work

• Unnamed Item
• Sperner systems consisting of pairs of complementary subsets
• The Representation of a Graph by Set Intersections

This page was built for publication: On a clique covering problem of Orlin