On clique covers and independence numbers of graphs
From MaRDI portal
Publication:1839263
DOI10.1016/0012-365X(83)90054-7zbMATH Open0512.05048MaRDI QIDQ1839263FDOQ1839263
Authors: Ronald D. Dutton, Robert Brigham 
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Title not available (Why is that?)
- The Representation of a Graph by Set Intersections
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Coherent network partitions: characterizations with cographs and prime graphs
- Duality and perfection for edges in cliques
- Coherent network partitions
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
- Upper bounds on the edge clique cover number of a graph
- Applications of edge coverings by cliques
- Maximum set of edges no two covered by a clique
This page was built for publication: On clique covers and independence numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1839263)
