Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Archdeacon, Dan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Representing graphs in Steiner triple systems
Dan Archdeacon
,
Terry Griggs
,
Costas Psomas
Graphs and Combinatorics
30
(2), 2014, pp. 255-266
Steiner triple systems, pinched surfaces, and complete multigraphs
Dan Archdeacon
Graphs and Combinatorics
30
(6), 2014, pp. 1351-1361
Obstructions for embedding cubic graphs on the spindle surface
Dan Archdeacon
,
C. Paul Bonnington
Journal of Combinatorial Theory Series B
91
(2), 2004, pp. 229-252
Sewing ribbons on graphs in space
Dan Archdeacon
,
C. Paul Bonnington
,
R. Bruce Richter
,
Jozef S̑irán̑
Journal of Combinatorial Theory Series B
86
(1), 2002, pp. 1-26
Two graphs without planar covers
Dan Archdeacon
Journal of Graph Theory
41
(4), 2002, pp. 318-326
Obstruction sets for outer-cylindrical graphs
Dan Archdeacon
,
C. Paul Bonnington
,
Nathaniel Dean
,
Nora Hartsfield
,
Katherine Scott
Journal of Graph Theory
38
(1), 2001, pp. 42-64
Trading crossings for handles and crosscaps
Dan Archdeacon
,
C. Paul Bonnington
,
Jozef S̑irán̑
Journal of Graph Theory
38
(4), 2001, pp. 230-243
Two maps on one surface
Dan Archdeacon
,
C. Paul Bonnington
Journal of Graph Theory
36
(4), 2001, pp. 198-216
Chromatic numbers of quadrangulations on closed surfaces
Dan Archdeacon
,
Joan Hutchinson
,
Atsuhiro Nakamoto
,
Seiya Negam
,
Katsuhiro Ota
Journal of Graph Theory
(2), 2001, pp. 100-114
Four-terminal reducibility and projective-planar Wye-Delta-Wye-reducible graphs
Dan Archdeacon
,
Charles J. Colbourn
,
Isidoro Gitler
,
J. Scott Provan
Journal of Graph Theory
33
(2), 2000, pp. 83-93
A Nebeský-type characterization for relative maximum genus
Dan Archdeacon
,
C. Paul Bonnington
,
Jozef S̑irán̑
Journal of Combinatorial Theory Series B
73
(1), 1998, pp. 77-98
Characterizing planarity using theta graphs
Dan Archdeacon
,
Josef S̑irán̑
Journal of Graph Theory
27
(1), 1998, pp. 17-20
Nonhamiltonian triangulations with large connectivity and representativity
Dan Archdeacon
,
Nora Hartsfield
,
C.H.C. Little
Journal of Combinatorial Theory Series B
68
(1), 1996, pp. 45-55
An algebraic characterization of planar graphs
Dan Archdeacon
,
C. Paul Bonnington
,
Charles H.C. Little
Journal of Graph Theory
19
(2), 1995, pp. 237-250
Self-dual embeddings of complete multipartite graphs
Dan Archdeacon
Journal of Graph Theory
18
(7), 1994, pp. 735-749
Indecomposable triple systems exist for all lambda
Dan Archdeacon
,
Jeff Dinitz
Discrete Mathematics
113
(1-3), 1993, pp. 1-6
The construction of self-dual projective polyhedra
Dan Archdeacon
,
Seiya Negami
Journal of Combinatorial Theory Series B
59
(1), 1993, pp. 122-131
Self-dual embeddings of complete bipartite graphs
Dan Archdeacon
,
Nora Hartsfield
Journal of Combinatorial Theory Series B
54
(2), 1992, pp. 249-256
The construction and classification of self-dual spherical polyhedra
Dan Archdeacon
,
R. Bruce Richter
Journal of Combinatorial Theory Series B
54
, 1992, pp. 37-63
Densely embedded graphs
Dan Archdeacon
Journal of Combinatorial Theory Series B
54
, 1992, pp. 13-36
On the parity of planar covers
Dan Archdeacon
,
R. Bruce Richter
Journal of Graph Theory
14
(2), 1990, pp. 199-204
A Kuratowski theorem for nonorientable surfaces
Dan Archdeacon
,
Phil Huneke
Journal of Combinatorial Theory Series B
46
, 1989, pp. 173-231
On the parity of crossing numbers
Dan Archdeacon
,
R. Bruce Richter
Journal of Graph Theory
12
(3), 1988, pp. 307-310
A note on defective colorings of graphs in surfaces
Dan Archdeacon
Journal of Graph Theory
11
(4), 1987, pp. 517-519
The nonorientable genus is additive
Dan Archdeacon
Journal of Graph Theory
10
(3), 1986, pp. 363-383
Seiten 1
2
>