On a clique covering problem of Orlin

DOI10.1016/0012-365X(82)90085-1MaRDI QIDQ1164073zbMATH OpenOpenAlexFDO

Authors D. 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

clique coveringcomplete graphperfect matching

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• Sperner systems consisting of pairs of complementary subsets
• The Representation of a Graph by Set Intersections

Cited in

(13)

• Covering graphs by the minimum number of equivalence relations
• Clique partitions and clique coverings
• A note on induced cycles in Kneser graphs
• Edge clique covering sum of graphs
• Biclique cover and local clique cover of graphs
• An overview of graph covering and partitioning
• Avoiding exponential explosion in Petri net models of control flows
• Clique Partitions of Chordal Graphs
• Duality and perfection for edges in cliques
• On Blocky Ranks Of Matrices
• The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
• Applications of edge coverings by cliques
• A simple lower bound on edge coverings by cliques

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

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