- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| j29 |      | Erich Prisner: Generalizing the Wolf-Goat-Cabbage Problem. Electronic Notes in Discrete Mathematics 27: 83 (2006) |
| 2004 | ||
| j28 | | Roger Labahn, Arthur L. Liestman, Erich Prisner: Preface. Discrete Applied Mathematics 137(2): 125-126 (2004) |
| j27 | | Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: AT-free graphs: linear bounds for the oriented diameter. Discrete Applied Mathematics 141(1-3): 135-148 (2004) |
| j26 | | Erich Prisner: k-Pseudosnakes in n-dimensional Hypercubes. Electronic Notes in Discrete Mathematics 17: 237-240 (2004) |
| c4 |  | |
| 2003 | ||
| j25 | | Erich Prisner: The recognition problem for line bigraphs. Discrete Mathematics 268(1-3): 243-256 (2003) |
| 2002 | ||
| c3 | | |
| 2001 | ||
| j24 | | Erich Prisner: Eulerian iterated line graphs and digraphs. Discrete Mathematics 236(1-3): 315-323 (2001) |
| j23 | | Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport: Bilateral Orientations and Domination. Electronic Notes in Discrete Mathematics 7: 26-29 (2001) |
| 2000 | ||
| j22 | | |
| j21 | | |
| j20 | | |
| j19 | | Erich Prisner: Eccentricity-approximating trees in chordal graphs. Discrete Mathematics 220(1-3): 263-269 (2000) |
| j18 | | Erich Prisner: Recognizing random intersection graphs. Discrete Mathematics 223(1-3): 263-274 (2000) |
| j17 | | Eric Goles Ch., Erich Prisner: Source reversal and chip firing on graphs. Theor. Comput. Sci. 233(1-2): 287-295 (2000) |
| 1999 | ||
| j16 | | Erich Prisner, Jayme Luiz Szwarcfiter: Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discrete Applied Mathematics 94(1-3): 321-328 (1999) |
| j15 | | Erich Prisner: Generalized octahedra and cliques in intersection graphs of uniform hypergraphs. Discrete Mathematics 206(1-3): 187-195 (1999) |
| 1998 | ||
| j14 | | Erich Prisner: Intersection Multigraphs of Uniform Hypergraphs. Graphs and Combinatorics 14(4): 363-375 (1998) |
| 1997 | ||
| j13 | | Erich Prisner: Radius versus diameter in cocomparability and intersection graphs. Discrete Mathematics 163(1-3): 109-117 (1997) |
| c2 | | |
| c1 | | Erich Prisner: Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. WG 1997: 273-287 |
| 1996 | ||
| j12 | | Erich Prisner, Jerzy Topp, Preben D. Vestergaard: Well covered simplicial, chordal, and circular arc graphs. Journal of Graph Theory 21(2): 113-119 (1996) |
| 1995 | ||
| j11 | | Erich Prisner: Clique Covering and Clique Partition in Generalizations of Line Graphs. Discrete Applied Mathematics 56(1): 93-98 (1995) |
| 1994 | ||
| j10 | | Erich Prisner: Algorithms for Interval Catch Digraphs. Discrete Applied Mathematics 51(1-2): 147-157 (1994) |
| j9 | | |
| j8 | | Erich Prisner: A common generalization of line graphs and clique graphs. Journal of Graph Theory 18(3): 301-313 (1994) |
| 1993 | ||
| j7 | | Erich Prisner: The dynamics of the line and path graph operators. Graphs and Combinatorics 9(2-4): 335-352 (1993) |
| j6 | | Jørgen Bang-Jensen, Jing Huang, Erich Prisner: In-Tournament Digraphs. J. Comb. Theory, Ser. B 59(2): 267-287 (1993) |
| 1992 | ||
| j5 | | |
| j4 | | Van Bang Le, Erich Prisner: On inverse problems for the cycle graph operator. Graphs and Combinatorics 8(2): 155-164 (1992) |
| j3 | | Erich Prisner: Two algorithms for the subset interconnection design problem. Networks 22(4): 385-395 (1992) |
| 1991 | ||
| j2 | | Hans-Jürgen Bandelt, Erich Prisner: Clique graphs and Helly graphs. J. Comb. Theory, Ser. B 51(1): 34-45 (1991) |
| 1989 | ||
| j1 | | Erich Prisner: A characterization of interval catch digraphs. Discrete Mathematics 73(3): 285-289 (1989) |
Colors in the list of coauthors
Last update Thu May 23 11:38:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page