Pages that link to "Item:Q805625"
From MaRDI portal
The following pages link to Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625):
Displaying 6 items.
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)