Pages that link to "Item:Q1934316"
From MaRDI portal
The following pages link to 3-colouring AT-free graphs in polynomial time (Q1934316):
Displaying 7 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
