Jan Kurkofka

According to our database, Jan Kurkofka authored at least 19 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

A Tutte-type canonical decomposition of 3- and 4-connected graphs.

Jan Kurkofka, Tim Planken

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

A Tutte-type canonical decomposition of 4-connected graphs.

Jan Kurkofka, Tim Planken

CoRR, April, 2025

On the edge-chromatic number of 2-complexes.

Jan Kurkofka, Emily Nevinson

Discret. Math., 2025

Characterising 4-Tangles Through a Connectivity Property.

Johannes Carmesin, Jan Kurkofka

Electron. J. Comb., 2025

2024

The immersion-minimal infinitely edge-connected graph.

Paul Knappe, Jan Kurkofka

J. Comb. Theory B, January, 2024

Entanglements.

Johannes Carmesin, Jan Kurkofka

J. Comb. Theory B, January, 2024

2023

The Lovász-Cherkassky theorem for locally finite graphs with ends.

Raphael W. Jacobs, Attila Joó, Paul Knappe, Jan Kurkofka, Ruben Melcher

Discret. Math., December, 2023

Canonical decompositions of 3-connected graphs.

Johannes Carmesin, Jan Kurkofka

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

End-faithful spanning trees in graphs without normal spanning trees.

Carl Bürger, Jan Kurkofka

J. Graph Theory, 2022

Duality theorems for stars and combs IV: Undominating stars.

Carl Bürger, Jan Kurkofka

J. Graph Theory, 2022

Duality theorems for stars and combs III: Undominated combs.

Carl Bürger, Jan Kurkofka

J. Graph Theory, 2022

Duality theorems for stars and combs II: Dominating stars and dominated combs.

Carl Bürger, Jan Kurkofka

J. Graph Theory, 2022

Duality theorems for stars and combs I: Arbitrary stars and combs.

Carl Bürger, Jan Kurkofka

J. Graph Theory, 2022

Countably determined ends and graphs.

Jan Kurkofka, Ruben Melcher

J. Comb. Theory B, 2022

2021

Tangles and the Stone-Čech compactification of infinite graphs.

Jan Kurkofka, Max Pitz

J. Comb. Theory B, 2021

Approximating infinite graphs by normal trees.

Jan Kurkofka, Ruben Melcher, Max Pitz

J. Comb. Theory B, 2021

The Farey graph is uniquely determined by its connectivity.

Jan Kurkofka

J. Comb. Theory B, 2021

Ubiquity and the Farey graph.

Jan Kurkofka

Eur. J. Comb., 2021

2020

Edge-connectivity and tree-structure in finite and infinite graphs.

Christian Elbracht, Jan Kurkofka, Maximilian Teegen

CoRR, 2020