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