Pages that link to "Item:Q3299212"
From MaRDI portal
The following pages link to Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212):
Displaying 6 items.
- Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)