default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErich Prisner
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j30]Erich Prisner
:
Generalizing the Wolf-Goat-Cabbage Problem. Electron. Notes Discret. Math. 27: 83 (2006)- 2004
- [j29]Roger Labahn, Arthur L. Liestman, Erich Prisner:
Preface. Discret. Appl. Math. 137(2): 125-126 (2004) - [j28]Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141(1-3): 135-148 (2004) - [j27]Erich Prisner:
k-Pseudosnakes in n-dimensional Hypercubes. Electron. Notes Discret. Math. 17: 237-240 (2004) - [c4]Erich Prisner:
k-Pseudosnakes in n-dimensional Hypercubes. CTW 2004: 207-209 - 2003
- [j26]Erich Prisner:
The recognition problem for line bigraphs. Discret. Math. 268(1-3): 243-256 (2003) - 2002
- [c3]Martín Matamala, Erich Prisner, Ivan Rapaport:
k-pseudosnakes in Large Grids. LATIN 2002: 224-235 - 2001
- [j25]Erich Prisner:
Eulerian iterated line graphs and digraphs. Discret. Math. 236(1-3): 315-323 (2001) - [j24]Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7: 26-29 (2001) - 2000
- [j23]Erich Prisner:
A Note of k-Rotation Graphs. Ars Comb. 55 (2000) - [j22]Erich Prisner:
Bicliques in Graphs I: Bounds on Their Number. Comb. 20(1): 109-117 (2000) - [j21]Erich Prisner:
Recognizing k-path Graphs. Discret. Appl. Math. 99(1-3): 169-181 (2000) - [j20]Erich Prisner:
Eccentricity-approximating trees in chordal graphs. Discret. Math. 220(1-3): 263-269 (2000) - [j19]Erich Prisner:
Recognizing random intersection graphs. Discret. Math. 223(1-3): 263-274 (2000) - [j18]Eric Goles Ch., Erich Prisner:
Source reversal and chip firing on graphs. Theor. Comput. Sci. 233(1-2): 287-295 (2000)
1990 – 1999
- 1999
- [j17]Erich Prisner, Jayme Luiz Szwarcfiter:
Recognizing Clique Graphs of Directed and Rooted Path Graphs. Discret. Appl. Math. 94(1-3): 321-328 (1999) - [j16]Erich Prisner:
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs. Discret. Math. 206(1-3): 187-195 (1999) - 1998
- [j15]Erich Prisner:
Intersection Multigraphs of Uniform Hypergraphs. Graphs Comb. 14(4): 363-375 (1998) - 1997
- [j14]Erich Prisner:
Radius versus diameter in cocomparability and intersection graphs. Discret. Math. 163(1-3): 109-117 (1997) - [c2]Erich Prisner:
Distance Approximating Spanning Trees. STACS 1997: 499-510 - [c1]Erich Prisner:
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. WG 1997: 273-287 - 1996
- [j13]Erich Prisner, Jerzy Topp, Preben D. Vestergaard:
Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory 21(2): 113-119 (1996) - 1995
- [j12]Erich Prisner:
Clique Covering and Clique Partition in Generalizations of Line Graphs. Discret. Appl. Math. 56(1): 93-98 (1995) - 1994
- [j11]Erich Prisner:
Parallel Chip Firing on Digraphs. Complex Syst. 8(5) (1994) - [j10]Erich Prisner:
Algorithms for Interval Catch Digraphs. Discret. Appl. Math. 51(1-2): 147-157 (1994) - [j9]Van Bang Le, Erich Prisner:
Iteratedk-line graphs. Graphs Comb. 10(2-4): 193-203 (1994) - [j8]Erich Prisner:
A common generalization of line graphs and clique graphs. J. Graph Theory 18(3): 301-313 (1994) - 1993
- [j7]Erich Prisner:
The dynamics of the line and path graph operators. Graphs Comb. 9(2-4): 335-352 (1993) - [j6]Jørgen Bang-Jensen, Jing Huang, Erich Prisner:
In-Tournament Digraphs. J. Comb. Theory B 59(2): 267-287 (1993) - 1992
- [j5]Erich Prisner:
Convergence of iterated clique graphs. Discret. Math. 103(2): 199-207 (1992) - [j4]Van Bang Le, Erich Prisner:
On inverse problems for the cycle graph operator. Graphs Comb. 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 B 51(1): 34-45 (1991)
1980 – 1989
- 1989
- [j1]Erich Prisner:
A characterization of interval catch digraphs. Discret. Math. 73(3): 285-289 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-05 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
