default search action
"(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6."
Yingli Kang et al. (2022)
- Yingli Kang, Ligang Jin, Peipei Liu, Yingqian Wang:
(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6. Discret. Math. 345(4): 112758 (2022)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.