Karl Heuer

Orcid: 0000-0002-6841-9815

According to our database1, Karl Heuer authored at least 18 papers between 2000 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Infinite grids in digraphs.
Eur. J. Comb., 2026

2024
Ubiquity of locally finite graphs with extensive tree-decompositions.
Comb. Theory, 2024

2023
Ubiquity of graphs with nowhere-linear end structure.
J. Graph Theory, July, 2023

Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls.
J. Graph Theory, May, 2023

Addendum to: "Hamilton-laceable bi-powers of locally finite bipartite graphs" [Discrete Math. 345 (2022) 112777].
Discret. Math., 2023

2022
Characterising <i>k</i>-connected sets in infinite graphs.
J. Comb. Theory B, 2022

Topological ubiquity of trees.
J. Comb. Theory B, 2022

Hamilton-laceable bi-powers of locally finite bipartite graphs.
Discret. Math., 2022

Even circuits in oriented matroids.
Comb. Theory, 2022

Disjoint dijoins for classes of dicuts in finite and infinite digraphs.
Comb. Theory, 2022

2021
On the infinite Lucchesi-Younger conjecture I.
J. Graph Theory, 2021

An analogue of Edmonds' Branching Theorem for infinite digraphs.
Eur. J. Comb., 2021

2018
Infinite end-devouring sets of rays with prescribed start vertices.
Discret. Math., 2018

Hamiltonicity in Locally Finite Graphs: Two Extensions and a Counterexample.
Electron. J. Comb., 2018

2016
A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs.
Eur. J. Comb., 2016

2015
A sufficient condition for Hamiltonicity in locally finite graphs.
Eur. J. Comb., 2015

2007
Set theoretical and algebraic model for redundancies in the genetic code.
BMC Syst. Biol., 2007

2000
A Square Game: 10696.
Am. Math. Mon., 2000


  Loading...