38 citations · 246 across the 68 of their papers we have counts for
4 papers · 2 filters
Colouring Diamond-free Graphs
Konrad K. Dabrowski, François Dross, Daniël Paulusma
The Colouring problem is that of deciding, given a graph and an integer , whether admits a (proper) -colouring. For all graphs up to five vertices, we classify th…
Bounding the Clique-Width of -free Split Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new…
Kempe Equivalence of Colourings of Cubic Graphs
Carl Feghali, Matthew Johnson, Daniel Paulusma
Given a graph and a proper vertex colouring of , a Kempe chain is a subset of that induces a maximal connected subgraph of in which every vertex has one of two…
Bounding the Clique-Width of -free Chordal Graphs
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang +1
A graph is -free if it has no induced subgraph isomorphic to . Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3…