Publication:3035328
From MaRDI portal
zbMath0693.05049MaRDI QIDQ3035328
Shaohan Ma, Julin Wu, Walter D. Wallis
Publication date: 1989
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Unnamed Item, On the kernel size of clique cover reductions for random intersection graphs, On the equivalence covering number of splitgraphs, On the complete width and edge clique cover problems, Edge-clique covers of the tensor product, Fast constructive and improvement heuristics for edge clique covering, An overview of graph covering and partitioning, Computing square roots of trivially perfect and threshold graphs, Clique Cover and Graph Separation, Known Algorithms for Edge Clique Cover are Probably Optimal