On clique covers and independence numbers of graphs

DOI10.1016/0012-365X(83)90054-7MaRDI QIDQ1839263zbMATH OpenFDO

Authors Ronald D. Dutton, Robert 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)

Cites work

• scientific article; zbMATH DE number 4095497 (Why is no real title available?)
• scientific article; zbMATH DE number 3523605 (Why is no real title available?)
• scientific article; zbMATH DE number 3523606 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Parallel concepts in graph theory
• The Representation of a Graph by Set Intersections

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)