scientific article; zbMATH DE number 3926961

MaRDI QIDQ3701453zbMATH OpenFDO

Authors D. de Cean, D. A. Gregory

Publication date 1985

zbMATH Keywords

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

• Extremal clique coverings of complementary graphs
• Clique covering of graphs
• scientific article; zbMATH DE number 3954979
• A simple lower bound on edge coverings by cliques
• Clique partitions and clique coverings

Cited in

(14)

• Clique covering of graphs
• Extremal clique coverings of complementary graphs
• An overview of graph covering and partitioning
• Upper bounds on the Boolean rank of Kronecker products
• Weak clique-covering cycles and paths.
• Bounds for the clique cover width of factors of the apex graph of the planar grid
• Clique coverings of glued graphs at complete clones
• scientific article; zbMATH DE number 3954979 (Why is no real title available?)
• scientific article; zbMATH DE number 800297 (Why is no real title available?)
• On the number of cliques and cycles in graphs
• Linear operators preserving perimeters of undirected graphs
• The Number of Cliques in Graphs Covered by Long Cycles
• Upper bounds on the edge clique cover number of a graph
• A simple lower bound on edge coverings by cliques

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 Q3701453)