1. Bounding the Clique‐Width of H‐Free Chordal Graphs. Issue 1 (10th February 2017) Authors: Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël Journal: Journal of graph theory Issue: Volume 86:Issue 1(2017) Page Start: 42 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Filling the complexity gaps for colouring planar and bounded degree graphs. Issue 4 (31st May 2019) Authors: Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël Journal: Journal of graph theory Issue: Volume 92:Issue 4(2019) Page Start: 377 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Hereditary graph classes: When the complexities of coloring and clique cover coincide. Issue 3 (25th November 2018) Authors: Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël Journal: Journal of graph theory Issue: Volume 91:Issue 3(2019) Page Start: 267 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. Issue 1 (24th May 2021) Authors: Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Journal: Journal of graph theory Issue: Volume 98:Issue 1(2021) Page Start: 81 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗