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):
Displayed 10 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)