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="Walsh, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Inversion of cycle index sum relations for 2- and 3-connected graphs
R.W. Robinson
,
T.R. Walsh
Journal of Combinatorial Theory Series B
57
(2), 1993, pp. 289-308
Enumeration and generation of a class of regular digraphs
M.V.S. Ramanath
,
T.R. Walsh
Journal of Graph Theory
11
(4), 1987, pp. 471-479
Iteration strikes back - at the cyclic towers of Hanoi
T.R. Walsh
Information Processing Letters
16
(2), 1983, February, pp. 91-93
Generating nonisomorphic maps without storing them
T.R. Walsh
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 161-178
The towers of Hanoi revisited: moving the rings by counting the moves
T.R. Walsh
Information Processing Letters
15
(2), 1982, September, pp. 64-67
Counting nonisomorphic three-connected planar maps
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 33-44
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 12-32
Counting labelled three-connected and homeomorphically irreducible two-connected graphs
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 1-11
Counting rooted maps by genus III: Nonseparable maps
T.R.S. Walsh
,
A.B. Lehman
Journal of Combinatorial Theory Series B
18
, 1975, pp. 222-259
Hypermaps versus bipartite maps
T.R.S. Walsh
Journal of Combinatorial Theory Series B
18
, 1975, pp. 155-163
Counting rooted maps by genus.I
T.R.S. Walsh
,
A.B. Lehman
Journal of Combinatorial Theory Series B
13
, 1972, pp. 192-218
Counting rooted maps by genus.II
T. Walsh
,
A.B. Lehman
Journal of Combinatorial Theory Series B
13
, 1972, pp. 122-141