Pages that link to "Item:Q1146685"
From MaRDI portal
The following pages link to Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685):
Displaying 7 items.
- Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
- PTAS for Sparse General-valued CSPs (Q6075749) (← links)
- Sudoku number of graphs (Q6085209) (← links)
- 5-list coloring toroidal 6-regular triangulations in linear time (Q6132529) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
