Paulusma Danil

Danil Paulusma

Information about the author Danil Paulusma will soon be added to the site.
Found 9 papers in total
Minimal disconnected cuts in planar graphs
Minimal disconnected cuts in planar graphs
2016
The problem of finding a disconnected cut in a graph is NP‐hard in general but...
Finding Shortest Paths Between Graph Colourings
Finding Shortest Paths Between Graph Colourings
2016
The k ‐colouring reconfiguration problem asks whether, for a given graph G ,...
Choosability on H-free graphs
Choosability on H-free graphs
2013
A graph is H ‐free if it has no induced subgraph isomorphic to H . We determine...
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
2013
The Hamiltonian Cycle problem is the problem of deciding whether an n ‐vertex...
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
2014
A k ‐colouring of a graph G =( V , E ) is a mapping c : V →{1,2,…,...
Finding Induced Paths of Given Parity in Claw‐Free Graphs
Finding Induced Paths of Given Parity in Claw‐Free Graphs
2012
The Parity Path problem is to decide if a given graph contains both an induced path of...
Computing solutions for matching games
Computing solutions for matching games
2012
A matching game is a cooperative game ( N , v ) defined on a graph G = ( N , E ) with...
The computational complexity of the elimination problem in generalized sports competitions
The computational complexity of the elimination problem in generalized sports competitions
2004
Consider a sports competition among various teams playing against each other in pairs...
Matching games: The least core and the nucleolus
Matching games: The least core and the nucleolus
2003
A matching game is a cooperative game defined by a graph G = (N, E). The player set is...
Papers per page: