The following pages link to (Q5755526):
Displaying 11 items.
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
