Dan Archdeacon

According to our database, Dan Archdeacon authored at least 59 papers between 1980 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

A characterization of plane Gauss paragraphs.

Dan Archdeacon, Drago Bokal, Tanja Gologranc

Ars Math. Contemp., 2017

Superthrackles.

Dan Archdeacon, Kirsten Stor

Australas. J Comb., 2017

Representing graphs in Steiner triple systems - II.

Dan Archdeacon, Terry S. Griggs, Constantinos Psomas

Australas. J Comb., 2017

Whitney's theorem for 2-regular planar digraphs.

Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar

Australas. J Comb., 2017

Embedding quartic Eulerian digraphs on the plane.

Dan Archdeacon, C. Paul Bonnington, Bojan Mohar

Australas. J Comb., 2017

2015

Square integer Heffter arrays with empty cells.

Dan Archdeacon, Jeffrey H. Dinitz, Diane M. Donovan, Emine Sule Yazici

Des. Codes Cryptogr., 2015

Heffter Arrays and Biembedding Graphs on Surfaces.

Dan Archdeacon

Electron. J. Comb., 2015

Maximum genus, connectivity, and Nebeský's Theorem.

Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera

Ars Math. Contemp., 2015

2014

Representing Graphs in Steiner Triple Systems.

Dan Archdeacon, Terry S. Griggs, Costas Psomas

Graphs Comb., 2014

Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs.

Dan Archdeacon

Graphs Comb., 2014

Regular pinched maps.

Dan Archdeacon, C. Paul Bonnington, Jozef Sirán

Australas. J Comb., 2014

2007

How to Exhibit Toroidal Maps in Space.

Dan Archdeacon, C. Paul Bonnington, Joanna A. Ellis-Monaghan

Discret. Comput. Geom., 2007

2005

Preface.

Jin Ho Kwak, Gyula O. H. Katona, Dan Archdeacon

Discret. Math., 2005

A characterization of projective-planar signed graphs.

Dan Archdeacon, Marisa Debowsky

Discret. Math., 2005

Variations on a theme of Kuratowski.

Dan Archdeacon

Discret. Math., 2005

2004

Some remarks on domination.

Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster

J. Graph Theory, 2004

Obstructions for embedding cubic graphs on the spindle surface.

Dan Archdeacon, C. Paul Bonnington

J. Comb. Theory B, 2004

Cycle systems in the complete bipartite graph minus a one-factor.

Dan Archdeacon, Marisa Debowsky, Jeffrey H. Dinitz, Heather Gavlas

Discret. Math., 2004

Halin's theorem for cubic graphs on an annulus.

Dan Archdeacon, C. Paul Bonnington, Jozef Sirán

Discret. Math., 2004

2003

Halin's Theorem for the Msbius Strip.

Dan Archdeacon, C. Paul Bonnington, Marisa Debowsky, Michael Prestidge

Ars Comb., 2003

Regular clique covers of graphs.

Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán

Australas. J Comb., 2003

Topological Graph Theory.

Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White

Proceedings of the Handbook of Graph Theory., 2003

2002

Two graphs without planar covers.

Dan Archdeacon

J. Graph Theory, 2002

Sewing Ribbons on Graphs in Space.

Dan Archdeacon, C. Paul Bonnington, R. Bruce Richter, Jozef Sirán

J. Comb. Theory B, 2002

Nesting points in the sphere.

Dan Archdeacon, Feliu Sagols

Discret. Math., 2002

2001

Chromatic numbers of quadrangulations on closed surfaces.

Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota

J. Graph Theory, 2001

Trading crossings for handles and crosscaps.

Dan Archdeacon, C. Paul Bonnington, Jozef Sirán

J. Graph Theory, 2001

Obstruction sets for outer-cylindrical graphs.

Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott

J. Graph Theory, 2001

Two maps on one surface.

Dan Archdeacon, C. Paul Bonnington

J. Graph Theory, 2001

2000

Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs.

Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan

J. Graph Theory, 2000

Bipartite covering graphs.

Dan Archdeacon, Jin Ho Kwak, Jaeun Lee, Moo Young Sohn

Discret. Math., 2000

1998

Characterizing planarity using theta graphs.

Dan Archdeacon, Jozef Sirán

J. Graph Theory, 1998

A Nebeský-Type Characterization for Relative Maximum Genus.

Dan Archdeacon, C. Paul Bonnington, Jozef Sirán

J. Comb. Theory B, 1998

Obstruction Sets for Outer-Projective-Planar Graphs.

Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar

Ars Comb., 1998

1996

Nonhamiltonian Triangulations with Large Connectivity and Representativity.

Dan Archdeacon, Nora Hartsfield, C. H. C. Little

J. Comb. Theory, Ser. B, 1996

Maximum genus and connectivity.

Jianer Chen, Dan Archdeacon, Jonathan L. Gross

Discret. Math., 1996

The Hadwiger Number for the Product of Two Cycles.

Dan Archdeacon, C. Paul Bonnington, John Pearson, Jozef Sirán

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

An algebraic characterization of planar graphs.

Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little

J. Graph Theory, 1995

The genus of a random graph.

Dan Archdeacon, David A. Grable

Discret. Math., 1995

1994

Self-dual embeddings of complete multipartite graphs.

Dan Archdeacon

J. Graph Theory, 1994

Branched coverings of maps and lifts of map homomorphisms.

Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera

Australas. J Comb., 1994

1993

The Construction of Self-Dual Projective Polyhedra.

Dan Archdeacon, Seiya Negami

J. Comb. Theory B, 1993

Indecomposable triple systems exist for all lambda.

Dan Archdeacon, Jeffrey H. Dinitz

Discret. Math., 1993

1992

The construction and classification of self-dual spherical polyhedra.

Dan Archdeacon, R. Bruce Richter

J. Comb. Theory B, 1992

Self-dual embeddings of complete bipartite graphs.

Dan Archdeacon, Nora Hartsfield

J. Comb. Theory B, 1992

Densely embedded graphs.

Dan Archdeacon

J. Comb. Theory B, 1992

The medial graph and voltage- current duality.

Dan Archdeacon

Discret. Math., 1992

1991

Constructing indecomposable 1-factorizations of the complete multigraph.

Dan Archdeacon, Jeffrey H. Dinitz

Discret. Math., 1991

Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs.

Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little

Proceedings of the Planar Graphs, 1991

1990

On the parity of planar covers.

Dan Archdeacon, R. Bruce Richter

J. Graph Theory, 1990

1989

A Kuratowski theorem for nonorientable surfaces.

Dan Archdeacon, Phil Huneke

J. Comb. Theory B, 1989

1988

On the parity of crossing numbers.

Dan Archdeacon, R. Bruce Richter

J. Graph Theory, 1988

1987

A note on defective colorings of graphs in surfaces.

Dan Archdeacon

J. Graph Theory, 1987

1986

The orientable genus is nonadditive.

Dan Archdeacon

J. Graph Theory, 1986

The nonorientable genus is additive.

Dan Archdeacon

J. Graph Theory, 1986

1985

On cubic graphs which are irreducible for nonorientable surfaces.

Dan Archdeacon, John Philip Huneke

J. Comb. Theory B, 1985

1984

Face colorings of embedded graphs.

Dan Archdeacon

J. Graph Theory, 1984

1981

A Kuratowski theorem for the projective plane.

Dan Archdeacon

J. Graph Theory, 1981

1980

Some New Row-Complete Latin Squares.

Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson

J. Comb. Theory A, 1980