Hans Georg Carstens

	2000
5		Hans Georg Carstens, Thomas Dinski, Eckhard Steffen: Reduction of Symmetric Configurations n3. Discrete Applied Mathematics 99(1-3): 401-411 (2000)
	1987
4		Hans Georg Carstens: A 5-Color-Extension-Theorem. Computation Theory and Logic 1987: 67-77
	1983
3		Hans Georg Carstens, Peter Päppinghaus: Extensible algorithms. Logic and Machines 1983: 162-182
	1981
2		Hans Georg Carstens, Ulrich Golze: Recursive Paths in Cross-Connected Trees and an Application to Cell Spaces. Mathematical Systems Theory 15(1): 29-37 (1981)
	1977
1		Hans Georg Carstens, Arian Kruse: Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices. J. Comb. Theory, Ser. B 22(3): 286-288 (1977)

Coauthor Index

1	Thomas Dinski	[5]
2	Ulrich Golze	[2]
3	Arian Kruse	[1]
4	Peter Päppinghaus	[3]
5	Eckhard Steffen	[5]

Colors in the list of coauthors