An improved upper bound and algorithm for clique covers

DOI10.1016/j.jda.2018.03.002zbMath1391.05246OpenAlexW2794724561MaRDI QIDQ1748206

Michael Soltys, Ryan McIntyre

Publication date: 9 May 2018

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.03.002

zbMATH Keywords

indeterminatesclique coversMantel's theoremLovász bound

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Indeterminate strings, prefix arrays \& undirected graphs
• Applications of edge coverings by cliques
• Constructing an indeterminate string from its associated graph
• The Representation of a Graph by Set Intersections
• Unnamed Item