Filling the complexity gaps for colouring planar and bounded degree graphs

Konrad K. Dabrowski, François Dross, Matthew Johnson 0002, Daniël Paulusma. Filling the complexity gaps for colouring planar and bounded degree graphs. Journal of Graph Theory, 92(4):377-393, 2019. [doi]

Authors

Konrad K. Dabrowski

This author has not been identified. Look up 'Konrad K. Dabrowski' in Google

François Dross

This author has not been identified. Look up 'François Dross' in Google

Matthew Johnson 0002

This author has not been identified. Look up 'Matthew Johnson 0002' in Google

Daniël Paulusma

This author has not been identified. Look up 'Daniël Paulusma' in Google