A simple lower bound on edge coverings by cliques

DOI10.1016/0012-365X(90)90168-HMaRDI QIDQ807634zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3926961 (Why is no real title available?)
• Applications of edge coverings by cliques
• Covering graphs by the minimum number of equivalence relations
• On a clique covering problem of Orlin

Cited in

(18)

• scientific article; zbMATH DE number 4039954 (Why is no real title available?)
• An overview of graph covering and partitioning
• Linear operators preserving perimeters of undirected graphs
• scientific article; zbMATH DE number 800297 (Why is no real title available?)
• A property about minimum edge- and minimum clique-cover of a graph
• Covering graphs by the minimum number of equivalence relations
• Edge-clique covers of the tensor product
• Generalized covering designs and clique coverings
• 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
• Covering line graphs with equivalence relations
• scientific article; zbMATH DE number 3926961 (Why is no real title available?)
• Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
• Upper bounds on the edge clique cover number of a graph
• Graph reduction in the construction of minimal clique cover
• Covering arrays avoiding forbidden edges
• Edge-clique covers of the tensor product

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)