Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices. - Hans Georg Carstens; Arian Kruse (J. Comb. Theory B, 1977)

The Complexity of Some Combinatorial Constructions. - Hans Georg Carstens (Math. Log. Q., 1977)

Recursive Paths in Cross-Connected Trees and an Application to Cell Spaces. - Hans Georg Carstens; Ulrich Golze (Math. Syst. Theory, 1981)

Extensible algorithms. - Hans Georg Carstens; Peter Päppinghaus (Logic and Machines, 1983)

Recursive coloration of countable graphs. - Hans Georg Carstens; Peter Päppinghaus (Ann. Pure Appl. Log., 1983)

A 5-Color-Extension-Theorem. - Hans Georg Carstens (Computation Theory and Logic, 1987)

Nowhere-zero flows in low genus graphs. - Martina Möller; Hans Georg Carstens; Gunnar Brinkmann (J. Graph Theory, 1988)

Reduction of Symmetric Configurations n3. - Hans Georg Carstens; Thomas Dinski; Eckhard Steffen (Discret. Appl. Math., 2000)