8 citations · 17 across the 8 of their papers we have counts for
8 papers
On the Parameterized Complexity of -Edge Colouring
Esther Galby, Paloma T. Lima, Daniël Paulusma +1
For every fixed integer , we prove that -Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Daligault, Rao and Thomassé asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev rece…
Squares of Low Maximum Degree
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach +3
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of decid…
Editing to Eulerian Graphs
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +1
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let , and denote t…
Narrowing the Complexity Gap for Colouring (,)-Free Graphs
Shenwei Huang, Matthew Johnson, Daniël Paulusma
For a positive integer and graph , a -colouring of is a mapping such that whenever . The -Colourin…
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs
Konrad K. Dabrowski, Daniël Paulusma
If a graph has no induced subgraph isomorphic to any graph in a finite family , it is said to be -free. The class of -free graphs has bound…