default search action
Dan Archdeacon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j56]Dan Archdeacon, Kirsten Stor:
Superthrackles. Australas. J Comb. 67: 145-158 (2017) - [j55]Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar:
Whitney's theorem for 2-regular planar digraphs. Australas. J Comb. 67: 159-165 (2017) - [j54]Dan Archdeacon, Terry S. Griggs, Constantinos Psomas:
Representing graphs in Steiner triple systems - II. Australas. J Comb. 67: 243-258 (2017) - [j53]Dan Archdeacon, C. Paul Bonnington, Bojan Mohar:
Embedding quartic Eulerian digraphs on the plane. Australas. J Comb. 67: 364-377 (2017) - [j52]Dan Archdeacon, Drago Bokal, Tanja Gologranc:
A characterization of plane Gauss paragraphs. Ars Math. Contemp. 12(1): 31-36 (2017) - 2015
- [j51]Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera:
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9(1): 51-61 (2015) - [j50]Dan Archdeacon:
Heffter Arrays and Biembedding Graphs on Surfaces. Electron. J. Comb. 22(1): 1 (2015) - [j49]Dan Archdeacon, Jeffrey H. Dinitz, Diane M. Donovan
, Emine Sule Yazici
Square integer Heffter arrays with empty cells. Des. Codes Cryptogr. 77(2-3): 409-426 (2015) - 2014
- [j48]Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
Regular pinched maps. Australas. J Comb. 58: 16-26 (2014) - [j47]Dan Archdeacon, Terry S. Griggs, Costas Psomas:
Representing Graphs in Steiner Triple Systems. Graphs Comb. 30(2): 255-266 (2014) - [j46]Dan Archdeacon:
Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs. Graphs Comb. 30(6): 1351-1361 (2014)
2000 – 2009
- 2007
- [j45]Dan Archdeacon, C. Paul Bonnington
How to Exhibit Toroidal Maps in Space. Discret. Comput. Geom. 38(3): 573-594 (2007) - 2005
- [j44]Dan Archdeacon, Marisa Debowsky:
A characterization of projective-planar signed graphs. Discret. Math. 290(2/3): 109-116 (2005) - [j43]Dan Archdeacon:
Variations on a theme of Kuratowski. Discret. Math. 302(1-3): 22-31 (2005) - [j42]Jin Ho Kwak, Gyula O. H. Katona, Dan Archdeacon:
Preface. Discret. Math. 303(1-3): 1 (2005) - 2004
- [j41]Dan Archdeacon, C. Paul Bonnington
Halin's theorem for cubic graphs on an annulus. Discret. Math. 281(1-3): 13-25 (2004) - [j40]Dan Archdeacon, Marisa Debowsky, Jeffrey H. Dinitz, Heather Gavlas:
Cycle systems in the complete bipartite graph minus a one-factor. Discret. Math. 284(1-3): 37-43 (2004) - [j39]Dan Archdeacon, C. Paul Bonnington
Obstructions for embedding cubic graphs on the spindle surface. J. Comb. Theory B 91(2): 229-252 (2004) - [j38]Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek
Some remarks on domination. J. Graph Theory 46(3): 207-210 (2004) - 2003
- [j37]Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán:
Regular clique covers of graphs. Australas. J Comb. 27: 307- (2003) - [j36]Dan Archdeacon, C. Paul Bonnington, Marisa Debowsky, Michael Prestidge:
Halin's Theorem for the Msbius Strip. Ars Comb. 68 (2003) - [p1]Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White:
Topological Graph Theory. Handbook of Graph Theory 2003: 610-786 - 2002
- [j35]Dan Archdeacon, Feliu Sagols:
Nesting points in the sphere. Discret. Math. 244(1-3): 5-16 (2002) - [j34]Dan Archdeacon, C. Paul Bonnington
Sewing Ribbons on Graphs in Space. J. Comb. Theory B 86(1): 1-26 (2002) - [j33]Dan Archdeacon:
Two graphs without planar covers. J. Graph Theory 41(4): 318-326 (2002) - 2001
- [j32]Dan Archdeacon, C. Paul Bonnington:
Two maps on one surface. J. Graph Theory 36(4): 198-216 (2001) - [j31]Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic numbers of quadrangulations on closed surfaces. J. Graph Theory 37(2): 100-114 (2001) - [j30]Dan Archdeacon, C. Paul Bonnington
Obstruction sets for outer-cylindrical graphs. J. Graph Theory 38(1): 42-64 (2001) - [j29]Dan Archdeacon, C. Paul Bonnington
Trading crossings for handles and crosscaps. J. Graph Theory 38(4): 230-243 (2001) - 2000
- [j28]Dan Archdeacon, Jin Ho Kwak, Jaeun Lee, Moo Young Sohn:
Bipartite covering graphs. Discret. Math. 214(1-3): 51-63 (2000) - [j27]Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan:
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. J. Graph Theory 33(2): 83-93 (2000)
1990 – 1999
- 1998
- [j26]Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar:
Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) - [j25]Dan Archdeacon, C. Paul Bonnington
A Nebeský-Type Characterization for Relative Maximum Genus. J. Comb. Theory B 73(1): 77-98 (1998) - [j24]Dan Archdeacon, Jozef Sirán:
Characterizing planarity using theta graphs. J. Graph Theory 27(1): 17-20 (1998) - 1996
- [j23]Jianer Chen, Dan Archdeacon, Jonathan L. Gross:
Maximum genus and connectivity. Discret. Math. 149(1-3): 19-29 (1996) - [j22]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) - [c2]Dan Archdeacon, C. Paul Bonnington, John Pearson, Jozef Sirán:
The Hadwiger Number for the Product of Two Cycles. DMTCS 1996: 113-120 - 1995
- [j21]Dan Archdeacon, David A. Grable:
The genus of a random graph. Discret. Math. 142(1-3): 21-37 (1995) - [j20]Dan Archdeacon, C. Paul Bonnington
An algebraic characterization of planar graphs. J. Graph Theory 19(2): 237-250 (1995) - 1994
- [j19]Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera:
Branched coverings of maps and lifts of map homomorphisms. Australas. J Comb. 9: 109-122 (1994) - [j18]Dan Archdeacon:
Self-dual embeddings of complete multipartite graphs. J. Graph Theory 18(7): 735-749 (1994) - 1993
- [j17]Dan Archdeacon, Jeffrey H. Dinitz:
Indecomposable triple systems exist for all lambda. Discret. Math. 113(1-3): 1-6 (1993) - [j16]Dan Archdeacon, Seiya Negami
The Construction of Self-Dual Projective Polyhedra. J. Comb. Theory B 59(1): 122-131 (1993) - 1992
- [j15]Dan Archdeacon:
The medial graph and voltage- current duality. Discret. Math. 104(2): 111-141 (1992) - [j14]Dan Archdeacon:
Densely embedded graphs. J. Comb. Theory B 54(1): 13-36 (1992) - [j13]Dan Archdeacon, R. Bruce Richter:
The construction and classification of self-dual spherical polyhedra. J. Comb. Theory B 54(1): 37-63 (1992) - [j12]Dan Archdeacon, Nora Hartsfield:
Self-dual embeddings of complete bipartite graphs. J. Comb. Theory B 54(2): 249-256 (1992) - 1991
- [j11]Dan Archdeacon, Jeffrey H. Dinitz:
Constructing indecomposable 1-factorizations of the complete multigraph. Discret. Math. 92(1-3): 9-19 (1991) - [c1]Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little:
Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. Planar Graphs 1991: 1-3 - 1990
- [j10]Dan Archdeacon, R. Bruce Richter:
On the parity of planar covers. J. Graph Theory 14(2): 199-204 (1990)
1980 – 1989
- 1989
- [j9]Dan Archdeacon, Phil Huneke:
A Kuratowski theorem for nonorientable surfaces. J. Comb. Theory B 46(2): 173-231 (1989) - 1988
- [j8]Dan Archdeacon, R. Bruce Richter:
On the parity of crossing numbers. J. Graph Theory 12(3): 307-310 (1988) - 1987
- [j7]Dan Archdeacon:
A note on defective colorings of graphs in surfaces. J. Graph Theory 11(4): 517-519 (1987) - 1986
- [j6]Dan Archdeacon:
The nonorientable genus is additive. J. Graph Theory 10(3): 363-383 (1986) - [j5]Dan Archdeacon:
The orientable genus is nonadditive. J. Graph Theory 10(3): 385-401 (1986) - 1985
- [j4]Dan Archdeacon, John Philip Huneke:
On cubic graphs which are irreducible for nonorientable surfaces. J. Comb. Theory B 39(3): 233-264 (1985) - 1984
- [j3]Dan Archdeacon:
Face colorings of embedded graphs. J. Graph Theory 8(3): 387-398 (1984) - 1981
- [j2]Dan Archdeacon:
A Kuratowski theorem for the projective plane. J. Graph Theory 5(3): 243-246 (1981) - 1980
- [j1]Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson:
Some New Row-Complete Latin Squares. J. Comb. Theory A 29(3): 395-398 (1980)
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 20:26 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: