default search action
"Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete."
Michal Karpinski (2017)
- Michal Karpinski:
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete. Theor. Comput. Sci. 659: 88-94 (2017)
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.