Solving the clique cover problem on (bull, C₄)-free graphs
classification
💻 cs.DM
keywords
bullfreecliquecovergraphgraphsminimumalgorithm
read the original abstract
We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.