default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeif K. Jørgensen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Leif K. Jørgensen, Guillermo Pineda-Villavicencio, Julien Ugon
:
Linkedness of Cartesian products of complete graphs. Ars Math. Contemp. 22(2): 2 (2022)
2010 – 2019
- 2015
- [j18]Leif K. Jørgensen:
Normally Regular Digraphs. Electron. J. Comb. 22(4): 4 (2015) - [j17]Leif K. Jørgensen:
New mixed Moore graphs and directed strongly regular graphs. Discret. Math. 338(6): 1011-1016 (2015) - 2010
- [j16]Leif K. Jørgensen:
Schur rings and non-symmetric association schemes on 64 vertices. Discret. Math. 310(22): 3259-3266 (2010)
2000 – 2009
- 2009
- [j15]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of defect 2. Eur. J. Comb. 30(4): 798-808 (2009) - [j14]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of diameter 3 and defect 2. J. Graph Theory 61(4): 271-288 (2009) - [p1]Leif K. Jørgensen:
Algorithmic Approach to Non-symmetric 3-class Association Schemes. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 251-268 - 2007
- [j13]Leif K. Jørgensen, Ken-ichi Kawarabayashi:
Extremal results for rooted minor problems. J. Graph Theory 55(3): 191-207 (2007) - 2005
- [j12]Leif K. Jørgensen:
Girth 5 graphs from relative difference sets. Discret. Math. 293(1-3): 177-184 (2005) - 2003
- [j11]Leif K. Jørgensen, Mikhail H. Klin:
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices. Electron. J. Comb. 10 (2003) - [j10]Leif K. Jørgensen:
Non-existence of Directed Strongly regular Graphs. Discret. Math. 264(1-3): 111-126 (2003) - 2001
- [j9]Leif K. Jørgensen:
Directed strongly regular graphs with mu=lambda. Discret. Math. 231(1-3): 289-293 (2001) - [j8]Leif K. Jørgensen:
Vertex Partitions of K4, 4-Minor Free Graphs. Graphs Comb. 17(2): 265-274 (2001)
1990 – 1999
- 1995
- [j7]Leif K. Jørgensen:
Critical 3-cochromatic graphs. Graphs Comb. 11(3): 263-266 (1995) - 1994
- [j6]Leif K. Jørgensen:
Contractions to k8. J. Graph Theory 18(5): 431-448 (1994) - 1993
- [j5]Leif K. Jørgensen:
Nonexistence of certain cubic graphs with small diameters. Discret. Math. 114(1-3): 265-273 (1993) - 1992
- [j4]Leif K. Jørgensen:
Diameters of Cubic Graphs. Discret. Appl. Math. 37/38: 347-351 (1992) - [j3]Denis Hanson, Ping Wang, Leif K. Jørgensen:
On cages with given degree sets. Discret. Math. 101(1-3): 109-114 (1992) - 1990
- [j2]Leif K. Jørgensen, László Pyber:
Covering a graph by topological complete subgraphs. Graphs Comb. 6(2): 161-171 (1990)
1980 – 1989
- 1989
- [j1]Leif K. Jørgensen:
Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs. J. Graph Theory 13(1): 75-85 (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 2024-04-24 22:45 CEST 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:
