12 citations · 34 across the 21 of their papers we have counts for
Showing 2023 · math.COShow all
3 papers · 2 filters
math.CO2023★ 1 cited
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…
math.CO2023
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…
math.CO2023
Canonical Decompositions of 3-Connected Graphs
Johannes Carmesin, Jan Kurkofka
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or…