3 citations · 9 across the 15 of their papers we have counts for
29 papers
A characterisation of all vertex-transitive finite graphs of connectivity < 5
Jan Kurkofka, Tim Planken
We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical d…
A Tutte-type canonical decomposition of 3- and 4-connected graphs
Jan Kurkofka, Tim Planken
We provide a unique decomposition of every 4-connected graph into parts that are either quasi-5-connected, cycles of triangle-torsos and 3-connected torsos on vertices, ge…
Canonical graph decompositions via local separations
Raphael W. Jacobs, Paul Knappe, Jan Kurkofka
Every finite graph can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like…
Towards a Stallings-type theorem for finite groups
Johannes Carmesin, George Kontogeorgiou, Jan Kurkofka +1
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roug…
On the edge-chromatic number of 2-complexes
Jan Kurkofka, Emily Nevinson
We propose an open question that seeks to generalise the Four Colour Theorem from two to three dimensions. As an appetiser, we show that 12 instead of four colours are both suffici…
Characterising 4-tangles through a connectivity property
Johannes Carmesin, Jan Kurkofka
Every large -connected graph-minor induces a -tangle in its ambient graph. The converse holds for , but fails for . This raises the question whether `-conn…