A property about minimum edge- and minimum clique-cover of a graph

DOI10.1007/PL00013414MaRDI QIDQ5952389zbMATH OpenFDO

Authors Raffaele Mosca

Publication date 11 May 2003

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

matching

Mathematics Subject Classification ID

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

Recommendations

• A simple lower bound on edge coverings by cliques
• Upper bounds on the edge clique cover number of a graph
• scientific article; zbMATH DE number 617588
• Clique covering of graphs
• scientific article; zbMATH DE number 1545697

Cited in

(6)

• A shy invariant of graphs
• Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
• scientific article; zbMATH DE number 817208 (Why is no real title available?)
• On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
• The inductive graph dimension from the minimum edge clique cover
• scientific article; zbMATH DE number 1539532 (Why is no real title available?)

This page was built for publication: A property about minimum edge- and minimum clique-cover of a graph

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