On 3-colorability of (claw, diamond)-free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $(claw,diamond,K_4)$-free graphs. Recently, $3$-colorability has been also conside…