Regular paperThe complexity of planar graph choosability☆
Under an Elsevier user license
open archive
Cited by (0)
- ☆
This paper forms part of a Ph.D. thesis written by the author under the supervision of Prof. N. Alon and Prof. M. Tarsi in Tel Aviv University.
Copyright © 1996 Published by Elsevier B.V.