Conditionally Monotone Functions and Three Sperner Type Conditions. - Christoph Bandt; Gustav Burosch; Klaus-Dieter Drews (J. Inf. Process. Cybern., 1981)

The Telephone Problem for Connected Graphs. - Gustav Burosch; Waleri Wassiljewitsch Gorlow; Roger Labahn; Mario Szegedy (J. Inf. Process. Cybern., 1984)

Maximale Familien bezüglich einer verallgemeinerten Sperner-Bedingung. - Gustav Burosch; Klaus-Dieter Drews (J. Inf. Process. Cybern., 1986)

Some Intersection Theorems for Structures. - Gustav Burosch; Jean-Marie Laborde (Eur. J. Comb., 1988)

Characterization of grid graphs. - Gustav Burosch; Jean-Marie Laborde (Discret. Math., 1991)

On the Number of Databases and Closure Operations. - Gustav Burosch; János Demetrovics; Gyula O. H. Katona; Daniel J. Kleitman; Alexander A. Sapozhenko (Theor. Comput. Sci., 1991)

Distance monotone graphs and a new characterization of hypercubes. - Gustav Burosch; Ivan Havel; Jean-Marie Laborde (Discret. Math., 1992)

Isometric embeddings into cube-hypergraphs. - Gustav Burosch; Pier Vittorio Ceccherini (Discret. Math., 1995)

A characterization of cube-hypergraphs. - Gustav Burosch; Pier Vittorio Ceccherini (Discret. Math., 1996)

On posets of m-ary words. - Gustav Burosch; Hans-Dietrich O. F. Gronau; Jean-Marie Laborde; Ingo Warnke (Discret. Math., 1996)

Cartesian products of trees and paths. - Hans-Jürgen Bandelt; Gustav Burosch; Jean-Marie Laborde (J. Graph Theory, 1996)

The Automorphism Group of the Subsequence Poset Bm, n. - Gustav Burosch; Hans-Dietrich O. F. Gronau; Jean-Marie Laborde (Order, 1999)