The forest plus stars colouring problem
The author shows that every graph which is the union of a forest and a forest not containing a path of length three as a subgraph is 3- colorable.
scientific article; zbMATH DE number 540954