On clique covers and independence numbers of graphs

DOI10.1016/0012-365X(83)90054-7zbMath0512.05048MaRDI QIDQ1839263

Ronald D. Dutton, Robert C. Brigham

Publication date: 1983

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

zbMATH Keywords

independence numberline clique cover numbertriangle free graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (7)

Maximum set of edges no two covered by a clique ⋮ Duality and perfection for edges in cliques ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ Coherent network partitions: characterizations with cographs and prime graphs ⋮ Coherent network partitions ⋮ Applications of edge coverings by cliques ⋮ Upper bounds on the edge clique cover number of a graph

Cites Work

• Parallel concepts in graph theory
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On clique covers and independence numbers of graphs