#### Filter Results:

- Full text PDF available (28)

#### Publication Year

2002

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paul S. Bonsma, Luis Cereceda
- Theor. Comput. Sci.
- 2007

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)

- 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)

In the first part of this work we study the following question: Given two k-colorings α and β of a graph G on n vertices and an integer , can α be modified into β by recoloring vertices one at a time, while maintaining a k-coloring throughout and using at most such recoloring steps? This problem is weakly PSPACE-hard for every constant k ≥ 4. We show that… (More)

- Paul S. Bonsma, Florian Zickfeld
- LATIN
- 2008

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, Frederic Dorn
- ArXiv
- 2007

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)

- Paul S. Bonsma
- ArXiv
- 2010

- Paul S. Bonsma, Felix Breuer
- Algorithmica
- 2010

A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many hexagonal patches exist with this degree sequence along the outer face? This problem is motivated by the enumeration of… (More)

- Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann
- Discrete Mathematics
- 2002

- Paul S. Bonsma
- Theor. Comput. Sci.
- 2012

The Shortest Path Reconfiguration problem has as input a graph G with unit edge lengths, with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence. This problem is… (More)