Pages that link to "Item:Q596079"
From MaRDI portal
The following pages link to On unique graph 3-colorability and parsimonious reductions in the plane (Q596079):
Displaying 6 items.
- The size of edge-critical uniquely 3-colorable planar graphs (Q396890) (← links)
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete (Q3029023) (← links)
