


default search action
"The complexity of coloring graphs without long induced paths."
Gerhard J. Woeginger, Jirí Sgall (2001)
- Gerhard J. Woeginger, Jirí Sgall:
The complexity of coloring graphs without long induced paths. Acta Cybern. 15(1): 107-117 (2001)

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.