Shortly after solving the monopolar partition problem for line graphs, Jing and I realized that our solution could be used to solve the "precoloured" version of the problem, and then further extended to claw-free graphs.
Jing presented this paper at the 8th French Combinatorial Conference.
List monopolar partitions of claw-free graphs. Discrete Mathematics 312(17). Ross Churchley and Jing Huang (2012). ↩︎