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="McKay, B.D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Most Latin squares have many subsquares
B.D. McKay
,
I.M. Wanless
Journal of Combinatorial Theory Series A
86
(2), 1999, pp. 323-347
Asymptotic enumeration of Latin rectangles
C.D. Godsil
,
B.D. McKay
Journal of Combinatorial Theory Series B
48
, 1990, pp. 19-44
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
D.A. Holton
,
B.D. McKay
Journal of Combinatorial Theory Series B
45
, 1988, pp. 305-319
The number of matchings in random regular graphs and bipartite graphs
B. Bollobás
,
B.D. McKay
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 80-91
Constant time generation of free trees
R.A. Wright
,
B. Richmond
,
A. Odlyzko
,
B.D. McKay
SIAM Journal on Computing
15
(2), 1986, May, pp. 540-548
Hamiltonian cycles in cubic 3-connected bipartite planar graphs
D.A. Holton
,
B. Manvel
,
B.D. McKay
Journal of Combinatorial Theory Series B
38
, 1985, pp. 279-297
Automorphisms of random graphs with specified vertices
B.D. McKay
,
N.C. Wormald
Combinatorica
4
, 1984, pp. 325-338
A nine point theorem for 3-connected graphs
D.A. Holton
,
B.D. McKay
,
M.D. Plummer
,
C. Thomassen
Combinatorica
2
, 1982, pp. 53-62
Spectral conditions for the reconstructibility of a graph
C.D. Godsil
,
B.D. McKay
Journal of Combinatorial Theory Series B
30
(3), 1981, June, pp. 285-289
A correction to Colbourn's paper on the complexity of matrix symmetrizability
C.J. Colbourn
,
B.D. McKay
Information Processing Letters
11
(2), 1980, October, pp. 96-97
Computer reconstruction of small graphs
B.D. McKay
Journal of Graph Theory
1
(3), 1977, pp. 281-283