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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.