Pages that link to "Item:Q2798222"
From MaRDI portal
The following pages link to Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (Q2798222):
Displayed 5 items.
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)