Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hodur, Nadzieja"'
The $3$-colourability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where $bull$ is the graph consisting of $K_3$ with two pendant edges attached to two of its vertices. In this paper we study $3$-colo
Externí odkaz:
http://arxiv.org/abs/2404.12515
