The following pages link to (Q4947488):
Displaying 6 items.
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs (Q2178745) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- \(k\)-colouring when \(k\) is close to \(\Delta\) (Q2816123) (← links)
- The χt-coloring problem (Q4596640) (← links)
