Pages that link to "Item:Q828645"
From MaRDI portal
The following pages link to The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645):
Displaying 2 items.
The following pages link to The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645):
Displaying 2 items.