Pages that link to "Item:Q805625"

The following pages link to Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625):

Displaying 3 items.

• 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)