default search action
"Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, ..."
Xiangwen Li, Yuxue Yin, Gexin Yu (2020)
- Xiangwen Li, Yuxue Yin, Gexin Yu:
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. Discret. Math. 343(2): 111661 (2020)
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.