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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A short proof of Sperner's lemma
D. Lubell
Journal of Combinatorial Theory
1
, 1966, pp. 299
The number of faces of simplicial polytopes
John Riordan
Journal of Combinatorial Theory
1
, 1966, pp. 82 - 95
A packing problem for parallelepipeds
Hans Rademacher
,
Robert Dickson
,
Morris Plotkin
Journal of Combinatorial Theory
1
, 1966, pp. 3-14
On the algebraic theory of graph colorings
W.T. Tutte
Journal of Combinatorial Theory
1
, 1966, pp. 15-50
Graphs and composite games
Cedric A.B. Smith
Journal of Combinatorial Theory
1
, 1966, pp. 51-81
A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes
R.C. Bose
,
R.C. Burton
Journal of Combinatorial Theory
1
, 1966, pp. 96-104
On hearing the shape of a drum
Michael E. Fisher
Journal of Combinatorial Theory
1
, 1966, pp. 105-125
The Möbius function of a lattice
Henry H. Crapo
Journal of Combinatorial Theory
1
, 1966, pp. 126-131
Block designs and graph theory
Jane W. di Paola
Journal of Combinatorial Theory
1
, 1966, pp. 132-148
On the construction of certain graphs
P. Erdŏs
Journal of Combinatorial Theory
1
, 1966, pp. 149-153
Families of non-disjoint subsets
Daniel J. Kleitman
Journal of Combinatorial Theory
1
, 1966, pp. 153-155
The power group enumeration theorem
Frank Harary
,
Ed Palmer
Journal of Combinatorial Theory
1
, 1966, pp. 157-173
On separating systems of a finite set
G. Katona
Journal of Combinatorial Theory
1
, 1966, pp. 174-194
Permutations with limited repetitions
Roberto Frucht
Journal of Combinatorial Theory
1
, 1966, pp. 195-201
A calculus for a certain class of word problems in groups
Clark T. Benson
,
N.S. Mendelsohn
Journal of Combinatorial Theory
1
, 1966, pp. 202-208
On a combinatorial conjecture of Erdŏs
Daniel J. Kleitman
Journal of Combinatorial Theory
1
, 1966, pp. 209-214
On partitions of a finite set
R.L. Graham
Journal of Combinatorial Theory
1
, 1966, pp. 215-223
A combinatorial proof of Cayley's theorem on Pfaffians
John H. Halton
Journal of Combinatorial Theory
1
, 1966, pp. 224-232
Evaluation of a class of binomial coefficient summations
W. Gould
,
J. Kaucký
Journal of Combinatorial Theory
1
, 1966, pp. 233-247
On some possibilities of generalizing the Lorentz group in the special relativity theory
C.J. Everett
,
S.M. Ulam
Journal of Combinatorial Theory
1
, 1966, pp. 248-270
Hall subgroups of the symmetric groups
John G. Thompson
Journal of Combinatorial Theory
1
, 1966, pp. 271-279
Tiling with polyominoes
Solomon W. Golomb
Journal of Combinatorial Theory
1
, 1966, pp. 280-296
On subsets containing a family of non-commensurable subsets of a finite set
D. Kleitman
Journal of Combinatorial Theory
1
, 1966, pp. 297-299
On the number of inequivalent Steiner triple systems
E.F., Jr. Assmus
,
H.F. Mattson
Journal of Combinatorial Theory
1
, 1966, pp. 301-305
On minimal graphs of maximum even girth
Robert Singleton
Journal of Combinatorial Theory
1
, 1966, pp. 306-332
Seiten 1
2
>