default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNora Hartsfield
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j17]Wenzhong Liu, Serge Lawrencenko
, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha:
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. J. Comb. Theory B 139: 1-26 (2019)
2000 – 2009
- 2009
- [j16]Alfred W. Hales, Nora Hartsfield:
The directed genus of the de Bruijn graph. Discret. Math. 309(17): 5259-5263 (2009) - 2004
- [j15]C. Paul Bonnington, Nora Hartsfield, Jozef Sirán:
Obstructions to directed embeddings of Eulerian digraphs in the plane. Eur. J. Comb. 25(6): 877-891 (2004) - 2001
- [j14]Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott:
Obstruction sets for outer-cylindrical graphs. J. Graph Theory 38(1): 42-64 (2001)
1990 – 1999
- 1998
- [j13]Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar:
Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) - 1996
- [j12]Dan Archdeacon, Nora Hartsfield, C. H. C. Little:
Nonhamiltonian Triangulations with Large Connectivity and Representativity. J. Comb. Theory, Ser. B 68(1): 45-55 (1996) - 1995
- [j11]Nora Hartsfield, W. F. Smyth:
A family of sparse graphs of large sum number. Discret. Math. 141(1-3): 163-171 (1995) - 1994
- [b1]Nora Hartsfield, Gerhard Ringel:
Pearls in graph theory - a comprehensive introduction (Reviewed Edition). Academic Press 1994, ISBN 978-0-12-328553-9, pp. I-X, 1-249 - 1992
- [j10]Dan Archdeacon, Nora Hartsfield:
Self-dual embeddings of complete bipartite graphs. J. Comb. Theory B 54(2): 249-256 (1992) - 1991
- [j9]Nora Hartsfield, Gerhard Ringel:
Clean triangulations. Comb. 11(2): 145-155 (1991) - 1990
- [j8]Nora Hartsfield, Gerhard Ringel:
Quadrangular embeddings of the complete even k-partite graph. Discret. Math. 81(1): 19-23 (1990)
1980 – 1989
- 1989
- [j7]Nora Hartsfield, Brad Jackson, Gerhard Ringel:
Hamilton surfaces for the complete even symmetric bipartite graph. Discret. Math. 78(1-2): 89-94 (1989) - [j6]Nora Hartsfield, Gerhard Ringel:
Minimal quadrangulations of orientable surfaces. J. Comb. Theory B 46(1): 84-95 (1989) - [j5]Nora Hartsfield, Gerhard Ringel:
Minimal quadrangulations of nonorientable surfaces. J. Comb. Theory A 50(2): 186-195 (1989) - 1987
- [j4]Nora Hartsfield:
The splitting number of the complete graph in the projective plane. Graphs Comb. 3(1): 349-356 (1987) - [j3]Nora Hartsfield:
On regular self-complementary graphs. J. Graph Theory 11(4): 537-538 (1987) - 1986
- [j2]Nora Hartsfield:
The toroidal splitting number of the complete graph Kn. Discret. Math. 62(1): 35-47 (1986) - 1985
- [j1]Nora Hartsfield, Brad Jackson, Gerhard Ringel:
The splitting number of the complete graph. Graphs Comb. 1(1): 311-329 (1985)
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-06-10 21:28 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:
