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: Journal=J. Comb.~Theory AND Volume=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on a theorem of Zaremba
Gerald Losey
Journal of Combinatorial Theory
6
, 1969, pp. 208-209
An inequality for
B_2
-sequences
Bernt Lindström
Journal of Combinatorial Theory
6
, 1969, pp. 211-212
On the number of
k
-simplexes in the
m
-th barycentric subdivision of an
r
-simplex
Joseph Zaks
Journal of Combinatorial Theory
6
, 1969, pp. 213-216
On a theorem of Nordhaus and Gaddum
B.M. Stewart
Journal of Combinatorial Theory
6
, 1969, pp. 217-218
A new class of symmetric block designs
George Szekeres
Journal of Combinatorial Theory
6
, 1969, pp. 219-221
A note on a class of Hadamard matrices
Jennifer Wallis
Journal of Combinatorial Theory
6
, 1969, pp. 222-223
A generalization of Sperner's lemma
Kirby A. Baker
Journal of Combinatorial Theory
6
, 1969, pp. 224-225
On the pairing process and the notion of genealogical distance
Jan Mycielski
,
S.M. Ulam
Journal of Combinatorial Theory
6
, 1969, pp. 227-234
The toroidal crossing number of
K_{m,n}
Richard K. Guy
,
T.A. Jenkyns
Journal of Combinatorial Theory
6
, 1969, pp. 235-250
A characterization of the
T_m
graph
Thomas A. Dowling
Journal of Combinatorial Theory
6
, 1969, pp. 251-263
Uniquely colorable graphs
Frank Harary
,
S.T. Hedetniemi
,
R.W. Robinson
Journal of Combinatorial Theory
6
, 1969, pp. 264-270
On uniquely colorable planar graphs
Gary Chartrand
,
Dennis P. Geller
Journal of Combinatorial Theory
6
, 1969, pp. 271-278
Automorphism groups of Hadamard matrices
William M. Kantor
Journal of Combinatorial Theory
6
, 1969, pp. 279-281
The uniqueness of the cubic lattice graph
Martin Aigner
Journal of Combinatorial Theory
6
, 1969, pp. 282-297
Note on a min-max problem of Leo Moser
Saharon Shelah
Journal of Combinatorial Theory
6
, 1969, pp. 298-300
The golden root of a chromatic polynomial
G. Berman
,
W.T. Tutte
Journal of Combinatorial Theory
6
, 1969, pp. 301-302
A note on the tree realizability of a distance matrix
J.M.S. Simões Pereira
Journal of Combinatorial Theory
6
, 1969, pp. 303-310
Hamiltonian cycles in a graph of degree 4
N.J.A. Sloane
Journal of Combinatorial Theory
6
, 1969, pp. 311-312
A bound for the number of matroids
Dominic J.A. Welsh
Journal of Combinatorial Theory
6
, 1969, pp. 313-316
Some maximal arcs in finite projective planes
R.H.F. Denniston
Journal of Combinatorial Theory
6
, 1969, pp. 317-319
An infinite class of 4-designs
W.O. Alltop
Journal of Combinatorial Theory
6
, 1969, pp. 320-322
Some results on the maximum length of circuits of spread
k
in the
d
-cube
Robert J. Douglas
Journal of Combinatorial Theory
6
, 1969, pp. 323-339
A geometric approach to a class of cyclic codes
Philippe Delsarte
Journal of Combinatorial Theory
6
, 1969, pp. 340-358
On a class of combinatorial inequalities
S.G. Williamson
Journal of Combinatorial Theory
6
, 1969, pp. 359-369
Cycle structure of automorphisms of finite cyclic groups
Shair Ahmad
Journal of Combinatorial Theory
6
, 1969, pp. 370-374
Seiten
<
1
2
3
>