Publications of Erich Prisner

Publications of Erich Prisner

1.1  Book

  1. Graph Dynamics, 1995, xv + 233 pages, Longman, "Pitman Research Notes in Mathematics Series", No. 338, ISBN 0 582 28696 4;

1.2  Published Papers

  1. Familien zusammenhängender Teilgraphen eines Graphen und ihre Durchschnittsgraphen, Dissertation Hamburg 1988, 133 pages;
  2. A characterization of interval catch digraphs, Discrete Math. 73 (1989) 285-289;
  3. Clique graphs and Helly graphs (joint work with H.J. Bandelt), J. Comb. Th. B 51 (1991) 34-45;
  4. Homology of the line graph and of related graph-valued functions, Archiv der Mathematik (1991) 400-404;
  5. Two algorithms for the minimum interconnection design problem, Networks 22 (1992) 385-395 (abstract);
  6. Convergence of iterated clique graphs, Discrete Math. 103 (1992) 199-207 (abstract);
  7. On inverse problems for the cycle graph operator (joint work with Van Bang Le), Graphs and Combinatorics 8 (1992) 155-164 (abstract);
  8. Representing triangulated graphs in stars, Abh. Math. Sem. Univ. Hamburg 62 (1992) 29-41; (abstract)
  9. The dynamics of the line and path graph operators, Graphs and Combinatorics 9 (1993) 335-352 (abstract);
  10. In-tournament digraphs (joint work with Jø rgen Bang-Jensen and Jing Huang), J. Comb. Th. B 59 (1993) 267-287 (abstract);
  11. Hereditary clique-Helly graphs, J. Combin. Math. Combin. Comput. 14 (1993) 216-220;
  12. A common generalization of line graphs and clique graphs, J. Graph Theory 18 (1994) 301-313;
  13. Algorithms for interval catch digraphs, Discrete Applied Mathematics 51 (1994) 147-157 (abstract);
  14. Intersection-representation by connected subgraphs of some n-cyclomatic graph, Ars Combinatoria 37 (1994) 16 pages (abstract);
  15. Iterated k-line graphs (joint work with Van Bang Le), Graphs and Combinatorics 10 (1994) 193-203 (abstract);
  16. Parallel chip firing on digraphs, Complex Systems 8 (1994) 367-383 (abstract);
  17. Clique-covering and clique-partition in generalizations of line graphs, Discrete Applied Mathematics 56 (1995) 93-98;
  18. Graphs with few cliques, in: Graph Theory, Combinatorics, and Applications: Proceedings of 7th Quadrennial International Conference on the Theory and Applications of Graphs (Y. Alavi, A. Schwenk ed.) John Wiley and Sons, Inc. (1995) 945- 956; (abstract)
  19. Well-covered simplicial, chordal, and circular arc graphs (joint work with P.D. Vestergaard and J. Topp), Journal of Graph Theory 21 (1996) 113-119;
  20. Infinite F-periodic graphs, Results in Mathematics 29 (1996) 137-148; (abstract)
  21. Line graphs and generalizations - a survey, in: Surveys in Graph Theory (G. Chartrand, M. Jacobson eds.) Congressus Numerantium 116 (1996) 193-230 (abstract);
  22. A note on powers and proper circular-arc graphs, J. Combin. Math. Combin. Comput. 22 (1996) 125-128 (abstract);
  23. Centers of special graphs, Proceedings of the 27th Southeastern Internat. Conf. on Combinatorics, Graph Theory and Computing (Baton Rouge 1996), Congressus Numerantium 120 (1996) 145-159;
  24. Radius versus diameter in cocomparability and intersection graphs, Discrete Mathematics 163 (1997) 109-117 (abstract);
  25. Distance approximating spanning trees, Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS97) LNCS 1200, (1997) 499-510;
  26. Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs, Proceedings of WG97, LNCS 1335 (1997) 273-287;
  27. Intersection multigraphs of uniform hypergraphs, Graphs and Comb. 14 (1998) 363-375 (abstract);
  28. Recognizing clique graphs of directed and rooted path graphs, (joint work with Jayme L Szwarcfiter), Discrete Applied Mathematics 94 (1999) 321-328;
  29. An approach to graph-theoretic homology (joint work with T.A. McKee), in Combinatorics, Graph Theory, and Algorithms (Y. Alavi, et al., editors), New Issues Press (Kalamazoo, MI) (1999) vol. 2, 631-640;
  30. Generalized octahedra and cliques in intersection graphs of uniform hypergraphs, Discrete Mathematics 206 (1999) 187-195 (abstract);
  31. Recognizing k-path graphs, Discrete Appl. Mathematics 99 (2000) 169-182, journal version of a part of [26] (abstract);
  32. Bicliques in graphs I: Bounds on their number, Combinatorica 20 (2000) 109-117 (abstract);
  33. Source reversal and chip firing on graphs, (joint work with E. Goles), Theoret. Comput. Sci. 233 (2000) 287-295 (abstract);
  34. A note on k-rotation graphs, Ars Combinatoria 55 (2000), 289-292 (abstract);
  35. Eccentricity-approximating trees in chordal graphs, Discrete Mathematics 220 (2000) 263-269 (abstract);
  36. Recognizing random intersection graphs, Discrete Math. 223 (2000) 263-274 (abstract)
  37. Eulerian iterated line graphs and digraphs, Discrete Math. 236 (2001) 315-323; (abstract);
  38. Additive tree spanners, (joint work with Dieter Kratsch , Hoàng-Oanh Le, Haiko Müller, Dorothea Wagner), SIAM J. Discrete Math. 17 (2003) 332-340.;
  39. The recognition problem for line bigraphs, Discrete Mathematics 268 (2003) 243-256.
  40. k-Pseudosnakes in Large Grids, (joint work with Martin Matamala, Ivan Rapaport) to appear in the proceedings of LATIN 2002;
  41. Bilateral orientation in graphs: Domination and AT-free graphs, (joint work with Fedor Fomin, Martin Matamala, Ivan Rapaport) 2001, 22 \Seiten;
  42. AT-free graphs: Linear bounds for the oriented diameter, (joint work with Fedor Fomin, Martin Matamala, Ivan Rapaport) Discrete Applied Mathematics 141 (2004) 135-148.

1.3  Unpublished

  1. Recognizing large degree Intersection Graphs of linear 3-uniform Hypergraphs (joint work with Y. Metelsky, S. Suzdal, R. Tyshkevich), unpublished preprint
  2. Generating interconnection networks by using graph operators, 2000, 11 pages;

1.4  Submitted

  1. Dividing Six Pralines, 13 pages, submitted.
  2. Income Distribution, Lorenz Curve, and Gini Index: A complex Calculus Project for the Classroom, 2009

1.5  Scripts



Erich Prisner, August 2010