30 citations · 66 across the 7 of their papers we have counts for
9 papers
Hamiltonicity in generalized quasi-dihedral groups
Babak Miraftab, Konstantinos Stavropoulos
Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free pr…
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…
Triangulations of simplices with vanishing local h-polynomial
André de Moura, Elijah Gunther, Sam Payne +2
Motivated by connections to intersection homology of toric morphisms, the motivic monodromy conjecture, and a question of Stanley, we study the structure of triangulations of simpl…
Splitting groups with cubic Cayley graphs of connectivity two
Babak Miraftab, Konstantinos Stavropoulos
A group splits over a subgroup if is either a free product with amalgamation or an HNN-extension . We invoke Bass-S…
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…
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…
Characterising Bounded Expansion by Neighbourhood Complexity
Felix Reidl, Fernando Sánchez Villaamil, Konstantinos Stavropoulos
We show that a graph class has bounded expansion if and only if it has bounded -neighbourhood complexity, i.e. for any vertex set of any subgraph of $G\in\cal G…
On the Medianwidth of Graphs
Konstantinos Stavropoulos
A median graph is a connected graph, such that for any three vertices there is exactly one vertex that lies simultaneously on a shortest -path, a shortest $(v,w)…
The Maximum k-Differential Coloring Problem
Michael Bekos, Stephen Kobourov, Michael Kaufmann +1
Given an -vertex graph and two positive integers , the ()-differential coloring problem asks for a coloring of the vertices of (if one exists)…