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
[1]
Hilfe
Suche: Author="Godsil, C.D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Eigenvalue bounds for independent sets
C.D. Godsil
,
M.W. Newman
Journal of Combinatorial Theory Series B
98
(4), 2008, pp. 721-734
Coloring an orthogonality graph
C.D. Godsil
,
M.W. Newman
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 683-692
Independent sets in association schemes
C.D. Godsil
,
M.W. Newman
Combinatorica
26
(4), 2006, pp. 431-443
Width and dual width of subsets in polynomial association schemes
A.E. Brouwer
,
C.D. Godsil
,
J.H. Koolen
,
W.J. Martin
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 255-271
Chromatic number and the 2-rank of a graph
C.D. Godsil
,
Gordon F. Royle
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 142-149
Combinatorics in statistical physics
C.D. Godsil
,
M. Grötschel
,
D.J.A. Welsh
Handbook of Combinatorics
2
, 1995, pp. 1925-1954
Quotients of association schemes
C.D. Godsil
,
W.J. Martin
Journal of Combinatorial Theory Series A
69
(2), 1995, pp. 185-199
Tools from linear algebra
C.D. Godsil
Handbook of Combinatorics
2
, 1995, pp. 1705-1748
Distance regular covers of the complete graph
C.D. Godsil
,
A.D. Hensel
Journal of Combinatorial Theory Series B
56
(2), 1992, pp. 205-238
Graphs with polynomial growth are covering graphs
C.D. Godsil
,
N. Seifter
Graphs and Combinatorics
8
, 1992, pp. 233-241
Asymptotic enumeration of Latin rectangles
C.D. Godsil
,
B.D. McKay
Journal of Combinatorial Theory Series B
48
, 1990, pp. 19-44
Distance-regular antipodal covering graphs
R.E.L. Aldred
,
C.D. Godsil
Journal of Combinatorial Theory Series B
45
, 1988, pp. 127-134
The chromatic connectivity of graphs
C.D. Godsil
,
R. Nowakowski
,
J. Nes̑etȓil
Graphs and Combinatorics
4
, 1988, pp. 229-233
Bounding the diameter of distance-regular graphs
C.D. Godsil
Combinatorica
8
, 1988, pp. 333-343
Reconstructing graphs from their
k
-edge deleted subgraphs
C.D. Godsil
,
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 360-363
Inverses of trees
C.D. Godsil
Combinatorica
5
, 1985, pp. 33-39
Graphs with three mutually pseudo-similar vertices
C.D. Godsil
,
W.L. Kocay
Journal of Combinatorial Theory Series B
35
, 1983, pp. 240-246
Constructing graphs with pairs of pseudo-similar vertices
C.D. Godsil
,
W.L. Kocay
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 146-155
Some graphs with characteristic polynomials which are not solvable by radicals
C.D. Godsil
Journal of Graph Theory
6
(2), 1982, pp. 211-214
On the theory of the matching polynomial
C.D. Godsil
,
I. Gutman
Journal of Graph Theory
5
(2), 1981, pp. 137-144
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
Matchings and walks in graphs
C.D. Godsil
Journal of Graph Theory
5
(3), 1981, pp. 285-297
Equiarboreal graphs
C.D. Godsil
Combinatorica
1
, 1981, pp. 163-167
On the full automorphism group of a graph
C.D. Godsil
Combinatorica
1
, 1981, pp. 243-256
Hermite polynomials and a duality relation for matchings polynomials
C.D. Godsil
Combinatorica
1
, 1981, pp. 257-262
Seiten 1
2
>