The following pages link to Colouring AT-Free Graphs (Q2912887):
Displaying 8 items.
- Anagram-free colorings of graphs (Q1689991) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← 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)
- (Q3433131) (← links)
- (Q4448763) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)