Every planar graph is 1-defective (9,2)-paintable

Ming Han, H. A. Kierstead, Xuding Zhu

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Fingerprint

Dive into the research topics of 'Every planar graph is 1-defective (9,2)-paintable'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science