B. Ries

activity

20152021

most citedOn the Parameterized Complexity of

k

-Edge Colouring

4 citations · 7 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2018

Classifying k-Edge Colouring for H-free Graphs

Esther Galby, Paloma T. Lima, Daniel Paulusma +1

A graph is $H$ -free if it does not contain an induced subgraph isomorphic to $H$ . For every integer $k$ and every graph $H$ , we determine the computational complexity of $k$ -Edge C…

cs.DS2017

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs

Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau +1

We study the following problem: for given integers $d$ , $k$ and graph $G$ , can we reduce some fixed graph parameter $π$ of $G$ by at least $d$ via at most $k$ graph operations from…

Classifying k-Edge Colouring for H-free Graphs

Contraction and Deletion Blockers for Perfect Graphs and H-free Graphs

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs