2000 character limit reached
Solving the clique cover problem on (bull, $C_4$)-free graphs (1704.00316v1)
Published 2 Apr 2017 in cs.DM
Abstract: We give an $O(n4)$ 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.