A simple lower bound on edge coverings by cliques

DOI10.1016/0012-365X(90)90168-HzbMath0731.05027OpenAlexW2001201148WikidataQ127124400 ScholiaQ127124400MaRDI QIDQ807634

N. E. Zubov

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90168-h

zbMATH Keywords

edge coveringedge clique-cover number

Mathematics Subject Classification ID

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

Related Items (7)

An overview of graph covering and partitioning ⋮ Edge-clique covers of the tensor product ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Редукция графа при поиске реберного покрытия минимальным числом клик ⋮ Generalized covering designs and clique coverings ⋮ Covering arrays avoiding forbidden edges

Cites Work

• Applications of edge coverings by cliques
• Covering graphs by the minimum number of equivalence relations
• On a clique covering problem of Orlin
• Unnamed Item

This page was built for publication: A simple lower bound on edge coverings by cliques