Planar graphs without intersecting 5-cycles are 4-choosable

Daiqiang Hu, Jian-Liang Wu. Planar graphs without intersecting 5-cycles are 4-choosable. Discrete Mathematics, 340(8):1788-1792, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.