Erich Prisner

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2006
Generalizing the Wolf-Goat-Cabbage Problem.
Electron. Notes Discret. Math., 2006

2004
k-Pseudosnakes in n-dimensional Hypercubes.
Electron. Notes Discret. Math., 2004

Preface.
Discret. Appl. Math., 2004

AT-free graphs: linear bounds for the oriented diameter.
Discret. Appl. Math., 2004

2003
The recognition problem for line bigraphs.
Discret. Math., 2003

2002
k-pseudosnakes in Large Grids.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Bilateral Orientations and Domination.
Electron. Notes Discret. Math., 2001

Eulerian iterated line graphs and digraphs.
Discret. Math., 2001

2000
Source reversal and chip firing on graphs.
Theor. Comput. Sci., 2000

Eccentricity-approximating trees in chordal graphs.
Discret. Math., 2000

Recognizing random intersection graphs.
Discret. Math., 2000

Recognizing k-path Graphs.
Discret. Appl. Math., 2000

Bicliques in Graphs I: Bounds on Their Number.
Comb., 2000

A Note of k-Rotation Graphs.
Ars Comb., 2000

1999
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs.
Discret. Math., 1999

Recognizing Clique Graphs of Directed and Rooted Path Graphs.
Discret. Appl. Math., 1999

1998
Intersection Multigraphs of Uniform Hypergraphs.
Graphs Comb., 1998

1997
Radius versus diameter in cocomparability and intersection graphs.
Discret. Math., 1997

Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Distance Approximating Spanning Trees.
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.
J. Graph Theory, 1996

1995
Clique Covering and Clique Partition in Generalizations of Line Graphs.
Discret. Appl. Math., 1995

1994
A common generalization of line graphs and clique graphs.
J. Graph Theory, 1994

Iterated<i>k</i>-line graphs.
Graphs Comb., 1994

Algorithms for Interval Catch Digraphs.
Discret. Appl. Math., 1994

Parallel Chip Firing on Digraphs.
Complex Syst., 1994

1993
In-Tournament Digraphs.
J. Comb. Theory, Ser. B, 1993

The dynamics of the line and path graph operators.
Graphs Comb., 1993

1992
Two algorithms for the subset interconnection design problem.
Networks, 1992

On inverse problems for the cycle graph operator.
Graphs Comb., 1992

Convergence of iterated clique graphs.
Discret. Math., 1992

1991
Clique graphs and Helly graphs.
J. Comb. Theory, Ser. B, 1991

1989
A characterization of interval catch digraphs.
Discret. Math., 1989


  Loading...