Gustav Burosch

According to our database, Gustav Burosch authored at least 12 papers between 1981 and 1999.

Collaborative distances:

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

1999

The Automorphism Group of the Subsequence Poset <i>B</i><i>m</i>, <i>n</i>.

Gustav Burosch, Hans-Dietrich O. F. Gronau, Jean-Marie Laborde

Order, 1999

1996

Cartesian products of trees and paths.

Hans-Jürgen Bandelt, Gustav Burosch, Jean-Marie Laborde

J. Graph Theory, 1996

On posets of m-ary words.

Gustav Burosch, Hans-Dietrich O. F. Gronau, Jean-Marie Laborde, Ingo Warnke

Discret. Math., 1996

A characterization of cube-hypergraphs.

Gustav Burosch, Pier Vittorio Ceccherini

Discret. Math., 1996

1995

Isometric embeddings into cube-hypergraphs.

Gustav Burosch, Pier Vittorio Ceccherini

Discret. Math., 1995

1992

Distance monotone graphs and a new characterization of hypercubes.

Gustav Burosch, Ivan Havel, Jean-Marie Laborde

Discret. Math., 1992

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

Characterization of grid graphs.

Gustav Burosch, Jean-Marie Laborde

Discret. Math., 1991

1988

Some Intersection Theorems for Structures.

Gustav Burosch, Jean-Marie Laborde

Eur. J. Comb., 1988

1986

Maximale Familien bezüglich einer verallgemeinerten Sperner-Bedingung.

Gustav Burosch, Klaus-Dieter Drews

J. Inf. Process. Cybern., 1986

1984

The Telephone Problem for Connected Graphs.

Gustav Burosch, Waleri Wassiljewitsch Gorlow, Roger Labahn, Mario Szegedy

J. Inf. Process. Cybern., 1984

1981

Conditionally Monotone Functions and Three Sperner Type Conditions.

Christoph Bandt, Gustav Burosch, Klaus-Dieter Drews

J. Inf. Process. Cybern., 1981