On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P

André Große, Jörg Rothe, Gerd Wechsung. On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett., 99(6):215-221, 2006. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.