Pages that link to "Item:Q805625"

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

Displayed 1 item.

• On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) ‎ (← links)