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]
No references recorded for this publication.
No citations of this publication recorded.