On the complexity of 4-coloring graphs without long induced paths

Van Bang Le, Bert Randerath, Ingo Schiermeyer. On the complexity of 4-coloring graphs without long induced paths. Theoretical Computer Science, 389(1-2):330-335, 2007. [doi]

Authors

Van Bang Le

This author has not been identified. Look up 'Van Bang Le' in Google

Bert Randerath

This author has not been identified. Look up 'Bert Randerath' in Google

Ingo Schiermeyer

This author has not been identified. Look up 'Ingo Schiermeyer' in Google