Upper bounds on the edge clique cover number of a graph

DOI10.1016/0012-365X(84)90101-8zbMath0548.05049MaRDI QIDQ799696

Robert C. Brigham, Ronald D. Dutton

Publication date: 1984

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

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)

Related Items (1)

Covering arrays avoiding forbidden edges

Uses Software

• INGRID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On clique covers and independence numbers of graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Über ein Extremalproblem der Graphentheorie
• Cliques in random graphs
• The Representation of a Graph by Set Intersections

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