On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles

Bernard Lidický. On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles. Australasian J. Combinatorics, 44:77-86, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.