Upper bounds on the edge clique cover number of a graph

DOI10.1016/0012-365X(84)90101-8zbMATH Open0548.05049MaRDI QIDQ799696FDOQ799696

Robert Brigham, Ronald D. Dutton

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Clique covering of graphs
• A simple lower bound on edge coverings by cliques
• Extremal clique coverings of complementary graphs
• Edge clique covering sum of graphs
• scientific article; zbMATH DE number 3926961

zbMATH Keywords

clique covers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel concepts in graph theory
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Cliques in random graphs
• Title not available (Why is that?)
• The Representation of a Graph by Set Intersections
• On clique covers and independence numbers of graphs
• Über ein Extremalproblem der Graphentheorie
• Title not available (Why is that?)

Cited In (10)

• The asymptotic order of the abdiff-tolerance edge clique cover number of \(K_{2,n}\)
• A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs
• Title not available (Why is that?)
• A property about minimum edge- and minimum clique-cover of a graph
• Edge clique covers in graphs with independence number two
• Title not available (Why is that?)
• On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\)
• Covering arrays avoiding forbidden edges
• Title not available (Why is that?)
• Clique covering of graphs

Uses Software

• INGRID

This page was built for publication: Upper bounds on the edge clique cover number of a graph

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