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.R.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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