scientific article; zbMATH DE number 109202

MaRDI QIDQ4024338zbMATH OpenFDO

Authors

Publication date 9 March 1993

zbMATH Keywords

upper boundvertex clique covering 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

• scientific article; zbMATH DE number 1933071
• Clique covering of graphs
• scientific article; zbMATH DE number 2170477
• On the edge-independence number and edge-covering number for regular graphs
• Upper bounds on the edge clique cover number of a graph

Cited in

(7)

• Covering the vertex set of a graph with subgraphs of smaller degree
• Identifying vertex covers in graphs
• scientific article; zbMATH DE number 1933071 (Why is no real title available?)
• scientific article; zbMATH DE number 2170477 (Why is no real title available?)
• On the edge-independence number and edge-covering number for regular graphs
• scientific article; zbMATH DE number 841571 (Why is no real title available?)
• scientific article; zbMATH DE number 861353 (Why is no real title available?)

This page was built for publication:

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