default search action
"Closing complexity gaps for coloring problems on H-free graphs."
Petr A. Golovach, Daniël Paulusma, Jian Song (2014)
- Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237: 204-214 (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.