Pages that link to "Item:Q2467358"
From MaRDI portal
The following pages link to Constructive generation of very hard 3-colorability instances (Q2467358):
Displayed 5 items.
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)