Erich Prisner

From MaRDI portal
Revision as of 16:14, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Erich Prisner to Erich Prisner: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:178604

Available identifiers

zbMath Open prisner.erichMaRDI QIDQ178604

List of research outcomes





PublicationDate of PublicationType
Distance approximating spanning trees2022-11-09Paper
https://portal.mardi4nfdi.de/entity/Q30997582011-12-01Paper
k-Pseudosnakes in n-dimensional Hypercubes2007-05-29Paper
Generalizing the Wolf-Goat-Cabbage Problem2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q30443292004-08-11Paper
AT-free graphs: Linear bounds for the oriented diameter2004-08-06Paper
Additive Tree Spanners2004-01-08Paper
The recognition problem for line bigraphs2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q45522062002-08-29Paper
Eulerian iterated line graphs and digraphs2002-03-20Paper
Recognizing random intersection graphs2001-11-09Paper
https://portal.mardi4nfdi.de/entity/Q27414582001-10-24Paper
Bicliques in graphs. I: Bounds on their number2001-06-13Paper
Eccentricity-approximating trees in chordal graphs2000-10-18Paper
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs2000-08-28Paper
Source reversal and chip firing on graphs2000-08-23Paper
Recognizing \(k\)-path graphs2000-08-03Paper
Recognizing clique graphs of directed and rooted path graphs1999-12-05Paper
Intersection multigraphs of uniform hypergraphs1999-04-09Paper
https://portal.mardi4nfdi.de/entity/Q43932791999-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43736871998-09-08Paper
https://portal.mardi4nfdi.de/entity/Q43932411998-08-09Paper
Radius versus diameter in cocomparability and intersection graphs1997-09-09Paper
https://portal.mardi4nfdi.de/entity/Q52845641997-08-03Paper
Infinite \(\Phi\)-periodic graphs1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q48710561996-03-28Paper
https://portal.mardi4nfdi.de/entity/Q48677171996-03-04Paper
Well covered simplicial, chordal, and circular arc graphs1996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48376611995-11-20Paper
Algorithms for interval catch digraphs1995-04-04Paper
Clique covering and clique partition in generalizations of line graphs1995-02-01Paper
The dynamics of the line and path graph operators1995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43055401994-10-12Paper
A common generalization of line graphs and clique graphs1994-10-10Paper
Iterated \(k\)-line graphs1994-09-26Paper
In-tournament digraphs1994-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42880861994-04-21Paper
Representing triangulated graphs in stars1993-08-31Paper
On inverse problems for the cycle graph operator1993-01-16Paper
Convergence of iterated clique graphs1993-01-16Paper
Two algorithms for the subset interconnection design problem1993-01-16Paper
Clique graphs and Helly graphs1991-01-01Paper
Homology of the line graph and of related graph-valued functions1991-01-01Paper
A characterization of interval catch digraphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047421988-01-01Paper

Research outcomes over time

This page was built for person: Erich Prisner