Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Complexity Results for Matching Cut Problems in Graphs Without Long Induced PathsHoàng-Oanh Le, Van Bang Le. wg 2023: 417-431 [doi] On mirror nodes in graphs without long induced pathsKatharina Hammersen, Bert Randerath. ajc, 55:263-272, 2013. [doi]
The following publications are possibly variants of this publication: