On a clique covering problem of orlin
- 31 December 1982
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 41 (1) , 97-99
- https://doi.org/10.1016/0012-365x(82)90085-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Contentment in graph theory: Covering graphs with cliquesIndagationes Mathematicae, 1977
- Sperner systems consisting of pairs of complementary subsetsJournal of Combinatorial Theory, Series A, 1973
- The Representation of a Graph by Set IntersectionsCanadian Journal of Mathematics, 1966