3 papers
math.CO2021
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
J. Pascal Gollin, Karl Heuer, Konstantinos Stavropoulos
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digra…
math.CO2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs
Nathan Bowler, Joshua Erde, Florian Lehner +3
A \emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \emph{dynamic colouring number} of a graph…
math.CO2016
Cops, Robber and Medianwidth Parameters
Konstantinos Stavropoulos
In previous work, we introduced median decompositions, a generalisation of tree decompositions where a graph can be modelled after any median graph, along with a hierarchy of -m…