#### Filter Results:

#### Publication Year

2002

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring vertices of G one at a time, making sure we always have a proper k-colouring of G? This decision problem is trivial for k = 2, and decidable in polynomial time for k = 3. Here we… (More)

We study the unsplittable flow problem on a path P. We are given a set of n tasks. Each task is specified by a sub path of P , a demand, and a profit. Moreover, each edge of P has a given capacity. The aim is to find a subset of the tasks with maximum profit, for which the given demands can be simultaneously routed along P , subject to the capacities. The… (More)

- Tim Nieberg, H Bodlaender, H J Broersma, P Brucker, P J M Havinga, J L Hurink +18 others
- 2004

Dit proefschrift is goedgekeurd door Acknowledgements Working towards a PhD is a long road with many bends and turns. It is impossible to do on one's own, and I had help and advice from a lot of people both from the academic and the 'real' world. In the end, it is this help that kept me going on this road, and made this trip the trip of my life. I am… (More)

- Paul S. Bonsma
- WG
- 2014

We study the following independent set reconfiguration problem, called TAR-Reachabi-lity: given two independent sets I and J of a graph G, both of size at least k, is it possible to transform I into J by adding and removing vertices one-by-one, while maintaining an independent set of size at least k throughout? This problem is known to be PSPACE-hard in… (More)

An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given digraph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was… (More)

It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4 + 2 leaves and that this can be improved to (n + 4)/3 for cubic graphs without the diamond K 4 − e as a subgraph. We generalize the second result by proving that every graph with minimum degree at least 3, without diamonds and certain subgraphs called… (More)

- Paul S Bonsma, W H M Zijm, Ir J P M Van Den Heuvel, H L Kratsch, E C Bodlaender, Van Berkum +1 other
- 2006

The graph shown on the cover of this thesis is one of the graphs used in the N P-completeness proofs of Chapter 3. The bold edges indicate a matching-cut in this graph, consisting of two of the six minimal matching-cuts possible in this graph. The cut consisting of the eleven dashed edges separates the graph into two parts with 56 vertices. This is a… (More)