A simple lower bound on edge coverings by cliques

DOI10.1016/0012-365X(90)90168-HzbMATH Open0731.05027OpenAlexW2001201148WikidataQ127124400 ScholiaQ127124400MaRDI QIDQ807634FDOQ807634

Authors: 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

Recommendations

• Upper bounds on the edge clique cover number of a graph
• Clique covering of graphs
• scientific article; zbMATH DE number 3926961
• scientific article
• Covering graphs by the minimum number of equivalence relations

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)

Cites Work

• Covering graphs by the minimum number of equivalence relations
• Applications of edge coverings by cliques
• On a clique covering problem of Orlin
• Title not available (Why is that?)

Cited In (17)

• Title not available (Why is that?)
• An overview of graph covering and partitioning
• Linear operators preserving perimeters of undirected graphs
• Title not available (Why is that?)
• A property about minimum edge- and minimum clique-cover of a graph
• Редукция графа при поиске реберного покрытия минимальным числом клик
• Covering graphs by the minimum number of equivalence relations
• Generalized covering designs and clique coverings
• Edge-clique covers of the tensor product
• The inductive graph dimension from the minimum edge clique cover
• The equivalence number of a line graph
• On the kernel size of clique cover reductions for random intersection graphs
• Title not available (Why is that?)
• Covering line graphs with equivalence relations
• Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
• Upper bounds on the edge clique cover number of a graph
• Covering arrays avoiding forbidden edges

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

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