Erich Prisner

According to our database, Erich Prisner authored at least 33 papers between 1989 and 2006.

Collaborative distances:

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

2006

Generalizing the Wolf-Goat-Cabbage Problem.

Erich Prisner

Electron. Notes Discret. Math., 2006

2004

k-Pseudosnakes in n-dimensional Hypercubes.

Erich Prisner

Electron. Notes Discret. Math., 2004

Preface.

Roger Labahn, Arthur L. Liestman, Erich Prisner

Discret. Appl. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.

Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport

Discret. Appl. Math., 2004

2003

The recognition problem for line bigraphs.

Erich Prisner

Discret. Math., 2003

2002

k-pseudosnakes in Large Grids.

Martín Matamala, Erich Prisner, Ivan Rapaport

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Bilateral Orientations and Domination.

Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport

Electron. Notes Discret. Math., 2001

Eulerian iterated line graphs and digraphs.

Erich Prisner

Discret. Math., 2001

2000

Source reversal and chip firing on graphs.

Eric Goles Ch., Erich Prisner

Theor. Comput. Sci., 2000

Eccentricity-approximating trees in chordal graphs.

Erich Prisner

Discret. Math., 2000

Recognizing random intersection graphs.

Erich Prisner

Discret. Math., 2000

Recognizing k-path Graphs.

Erich Prisner

Discret. Appl. Math., 2000

Bicliques in Graphs I: Bounds on Their Number.

Erich Prisner

Comb., 2000

A Note of k-Rotation Graphs.

Erich Prisner

Ars Comb., 2000

1999

Generalized octahedra and cliques in intersection graphs of uniform hypergraphs.

Erich Prisner

Discret. Math., 1999

Recognizing Clique Graphs of Directed and Rooted Path Graphs.

Erich Prisner, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 1999

1998

Intersection Multigraphs of Uniform Hypergraphs.

Erich Prisner

Graphs Comb., 1998

1997

Radius versus diameter in cocomparability and intersection graphs.

Erich Prisner

Discret. Math., 1997

Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.

Erich Prisner

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Distance Approximating Spanning Trees.

Erich Prisner

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

Well covered simplicial, chordal, and circular arc graphs.

Erich Prisner, Jerzy Topp, Preben D. Vestergaard

J. Graph Theory, 1996

1995

Clique Covering and Clique Partition in Generalizations of Line Graphs.

Erich Prisner

Discret. Appl. Math., 1995

1994

A common generalization of line graphs and clique graphs.

Erich Prisner

J. Graph Theory, 1994

Iterated<i>k</i>-line graphs.

Van Bang Le, Erich Prisner

Graphs Comb., 1994

Algorithms for Interval Catch Digraphs.

Erich Prisner

Discret. Appl. Math., 1994

Parallel Chip Firing on Digraphs.

Erich Prisner

Complex Syst., 1994

1993

In-Tournament Digraphs.

Jørgen Bang-Jensen, Jing Huang, Erich Prisner

J. Comb. Theory B, 1993

The dynamics of the line and path graph operators.

Erich Prisner

Graphs Comb., 1993

1992

Two algorithms for the subset interconnection design problem.

Erich Prisner

Networks, 1992

On inverse problems for the cycle graph operator.

Van Bang Le, Erich Prisner

Graphs Comb., 1992

Convergence of iterated clique graphs.

Erich Prisner

Discret. Math., 1992

1991

Clique graphs and Helly graphs.

Hans-Jürgen Bandelt, Erich Prisner

J. Comb. Theory B, 1991

1989

A characterization of interval catch digraphs.

Erich Prisner

Discret. Math., 1989