Pages that link to "Item:Q505438"

The following pages link to Two complexity results for the vertex coloring problem (Q505438):

Displaying 4 items.

• Polynomial cases for the vertex coloring problem (Q666663) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)