Pages that link to "Item:Q1835680"
From MaRDI portal
The following pages link to NP-completeness of a family of graph-colouring problems (Q1835680):
Displaying 6 items.
- On the complexity of H-coloring (Q1100215) (← links)
- The complexity of multicolouring (Q1113919) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- (Q6065467) (← links)
