default search action
"Every planar graph with cycles of length neither 4 nor 5 is (1, 1, ..."
Lingji Xu, Zhengke Miao, Yingqian Wang (2014)
- Lingji Xu, Zhengke Miao, Yingqian Wang:
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. J. Comb. Optim. 28(4): 774-786 (2014)
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.