We stand with Ukraine  

Jan Kurkofka

Orcid: 0000-0002-6712-0918

According to our database1, Jan Kurkofka authored at least 17 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the edge-chromatic number of 2-complexes.
[BibTeX]
[DOI]
Jan Kurkofka
,
Emily Nevinson
Discret. Math., 2025

2024
The immersion-minimal infinitely edge-connected graph.
[BibTeX]
[DOI]
Paul Knappe
,
Jan Kurkofka
J. Comb. Theory B, January, 2024

Entanglements.
[BibTeX]
[DOI]
Johannes Carmesin
,
Jan Kurkofka
J. Comb. Theory B, January, 2024

2023
The Lovász-Cherkassky theorem for locally finite graphs with ends.
[BibTeX]
[DOI]
Raphael W. Jacobs
,
Attila Joó
,
Paul Knappe
,
Jan Kurkofka
,
Ruben Melcher
Discret. Math., December, 2023

Characterising 4-tangles through a connectivity property.
[BibTeX]
[DOI]
Johannes Carmesin
,
Jan Kurkofka
CoRR, 2023

Canonical decompositions of 3-connected graphs.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Carl Bürger
,
Jan Kurkofka
J. Graph Theory, 2022

Duality theorems for stars and combs IV: Undominating stars.
[BibTeX]
[DOI]
Carl Bürger
,
Jan Kurkofka
J. Graph Theory, 2022

Duality theorems for stars and combs III: Undominated combs.
[BibTeX]
[DOI]
Carl Bürger
,
Jan Kurkofka
J. Graph Theory, 2022

Duality theorems for stars and combs II: Dominating stars and dominated combs.
[BibTeX]
[DOI]
Carl Bürger
,
Jan Kurkofka
J. Graph Theory, 2022

Duality theorems for stars and combs I: Arbitrary stars and combs.
[BibTeX]
[DOI]
Carl Bürger
,
Jan Kurkofka
J. Graph Theory, 2022

Countably determined ends and graphs.
[BibTeX]
[DOI]
Jan Kurkofka
,
Ruben Melcher
J. Comb. Theory B, 2022

2021
Tangles and the Stone-Čech compactification of infinite graphs.
[BibTeX]
[DOI]
Jan Kurkofka
,
Max Pitz
J. Comb. Theory B, 2021

Approximating infinite graphs by normal trees.
[BibTeX]
[DOI]
Jan Kurkofka
,
Ruben Melcher
,
Max Pitz
J. Comb. Theory B, 2021

The Farey graph is uniquely determined by its connectivity.
[BibTeX]
[DOI]
Jan Kurkofka
J. Comb. Theory B, 2021

Ubiquity and the Farey graph.
[BibTeX]
[DOI]
Jan Kurkofka
Eur. J. Comb., 2021

2020
Edge-connectivity and tree-structure in finite and infinite graphs.
[BibTeX]
[DOI]
Christian Elbracht
,
Jan Kurkofka
,
Maximilian Teegen
CoRR, 2020


  Loading...