Pages that link to "Item:Q2132368"

The following pages link to On coloring a class of claw-free graphs. (Q2132368):

Displaying 7 items.

• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
• Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
• On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)