Hans Georg Carstens

According to our database, Hans Georg Carstens authored at least 8 papers between 1977 and 2000.

Collaborative distances:

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

2000

Reduction of Symmetric Configurations n₃.

Hans Georg Carstens, Thomas Dinski, Eckhard Steffen

Discret. Appl. Math., 2000

1988

Nowhere-zero flows in low genus graphs.

Martina Möller, Hans Georg Carstens, Gunnar Brinkmann

J. Graph Theory, 1988

1987

A 5-Color-Extension-Theorem.

Hans Georg Carstens

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1983

Recursive coloration of countable graphs.

Hans Georg Carstens, Peter Päppinghaus

Ann. Pure Appl. Log., 1983

Extensible algorithms.

Hans Georg Carstens, Peter Päppinghaus

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1981

Recursive Paths in Cross-Connected Trees and an Application to Cell Spaces.

Hans Georg Carstens, Ulrich Golze

Math. Syst. Theory, 1981

1977

The Complexity of Some Combinatorial Constructions.

Hans Georg Carstens

Math. Log. Q., 1977

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, Ser. B, 1977