A characterization of interval catch digraphs. - Erich Prisner (Discret. Math., 1989)

Clique graphs and Helly graphs. - Hans-Jürgen Bandelt; Erich Prisner (J. Comb. Theory B, 1991)

Convergence of iterated clique graphs. - Erich Prisner (Discret. Math., 1992)

On inverse problems for the cycle graph operator. - Van Bang Le; Erich Prisner (Graphs Comb., 1992)

Two algorithms for the subset interconnection design problem. - Erich Prisner (Networks, 1992)

The dynamics of the line and path graph operators. - Erich Prisner (Graphs Comb., 1993)

In-Tournament Digraphs. - Jørgen Bang-Jensen; Jing Huang 007; Erich Prisner (J. Comb. Theory B, 1993)

Parallel Chip Firing on Digraphs. - Erich Prisner (Complex Syst., 1994)

Algorithms for Interval Catch Digraphs. - Erich Prisner (Discret. Appl. Math., 1994)

Iteratedk-line graphs. - Van Bang Le; Erich Prisner (Graphs Comb., 1994)

A common generalization of line graphs and clique graphs. - Erich Prisner (J. Graph Theory, 1994)

Clique Covering and Clique Partition in Generalizations of Line Graphs. - Erich Prisner (Discret. Appl. Math., 1995)

Well covered simplicial, chordal, and circular arc graphs. - Erich Prisner; Jerzy Topp; Preben D. Vestergaard (J. Graph Theory, 1996)

Distance Approximating Spanning Trees. - Erich Prisner (STACS, 1997)

Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. - Erich Prisner (WG, 1997)

Radius versus diameter in cocomparability and intersection graphs. - Erich Prisner (Discret. Math., 1997)

Intersection Multigraphs of Uniform Hypergraphs. - Erich Prisner (Graphs Comb., 1998)

Recognizing Clique Graphs of Directed and Rooted Path Graphs. - Erich Prisner; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1999)

Generalized octahedra and cliques in intersection graphs of uniform hypergraphs. - Erich Prisner (Discret. Math., 1999)

A Note of k-Rotation Graphs. - Erich Prisner (Ars Comb., 2000)

Bicliques in Graphs I: Bounds on Their Number. - Erich Prisner (Comb., 2000)

Recognizing k-path Graphs. - Erich Prisner (Discret. Appl. Math., 2000)

Recognizing random intersection graphs. - Erich Prisner (Discret. Math., 2000)

Eccentricity-approximating trees in chordal graphs. - Erich Prisner (Discret. Math., 2000)

Source reversal and chip firing on graphs. - Eric Goles Ch.; Erich Prisner (Theor. Comput. Sci., 2000)

Eulerian iterated line graphs and digraphs. - Erich Prisner (Discret. Math., 2001)

Bilateral Orientations and Domination. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Electron. Notes Discret. Math., 2001)

k-pseudosnakes in Large Grids. - Martín Matamala; Erich Prisner; Ivan Rapaport (LATIN, 2002)

The recognition problem for line bigraphs. - Erich Prisner (Discret. Math., 2003)

AT-free graphs: linear bounds for the oriented diameter. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Discret. Appl. Math., 2004)

Preface. - Roger Labahn; Arthur L. Liestman; Erich Prisner (Discret. Appl. Math., 2004)

k-Pseudosnakes in n-dimensional Hypercubes. - Erich Prisner (Electron. Notes Discret. Math., 2004)

Generalizing the Wolf-Goat-Cabbage Problem. - Erich Prisner (Electron. Notes Discret. Math., 2006)