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 YEAR=1968
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximal consistent families of triples
Joel Spencer
Journal of Combinatorial Theory
5
, 1968, pp. 1-8
On the maximal triangle-free edge-chromatic graphs in three colors
J.G. Kalbfleisch
,
R.G. Stanton
Journal of Combinatorial Theory
5
, 1968, pp. 9-20
Autometrized unary algebras
Robert A. Melter
Journal of Combinatorial Theory
5
, 1968, pp. 21-29
Combinatorial theorems and integral matrices
L. Mirsky
Journal of Combinatorial Theory
5
, 1968, pp. 30-44
An addition theorem modulo
p
John E. Olson
Journal of Combinatorial Theory
5
, 1968, pp. 45-52
An addition theorem for the elementary Abelian group
John E. Olson
Journal of Combinatorial Theory
5
, 1968, pp. 53-58
A combinatorial formula involving the Fredholm integral equation
David A. Klarner
Journal of Combinatorial Theory
5
, 1968, pp. 59-74
Diameters in graphs
Oystein Ore
Journal of Combinatorial Theory
5
, 1968, pp. 75-81
Cardinality of finite topologies
Henry, Jr. Sharp
Journal of Combinatorial Theory
5
, 1968, pp. 82-86
The number of score sequences in tournaments
John Riordan
Journal of Combinatorial Theory
5
, 1968, pp. 87-89
Forests of labeled trees
John Riordan
Journal of Combinatorial Theory
5
, 1968, pp. 90-103
The polynomial of a permutation representation
Ernest Snapper
Journal of Combinatorial Theory
5
, 1968, pp. 105-114
The least number of edges for graphs having symmetric automorphism groups
Louis V. Quintas
Journal of Combinatorial Theory
5
, 1968, pp. 115-125
On packing of squares and cubes
A. Meir
,
L. Moser
Journal of Combinatorial Theory
5
, 1968, pp. 126-134
Folding a strip of stamps
John E. Koehler
Journal of Combinatorial Theory
5
, 1968, pp. 135-152
On a conjecture of Milner on
k
-graphs with non-disjoint edges
Daniel J. Kleitman
Journal of Combinatorial Theory
5
, 1968, pp. 153-156
Maximal number of subsets of a finite set no
k
of which are pairwise disjoint
Daniel J. Kleitman
Journal of Combinatorial Theory
5
, 1968, pp. 157-163
On coloring graphs to maximize the proportion of multicolored
k
-edges
Paul Erdŏs
,
Daniel J. Kleitman
Journal of Combinatorial Theory
5
, 1968, pp. 164-169
Strongly geodetic graphs
Juraj Bosák
,
Anton Kotzig
,
S̑tefan Znám
Journal of Combinatorial Theory
5
, 1968, pp. 170-176
Enumeration of Latin squares with application to order 8
John Wesley Brown
Journal of Combinatorial Theory
5
, 1968, pp. 177-184
Strong maps of geometries
D.A. Higgs
Journal of Combinatorial Theory
5
, 1968, pp. 185-191
A partial characterization of clique graphs
Ronald C. Hamelink
Journal of Combinatorial Theory
5
, 1968, pp. 192-197
A lattice characterization of convexity
Mary Katherine Bennett
Journal of Combinatorial Theory
5
, 1968, pp. 198-202
Concavity properties and a generating function for Stirling numbers
Elliott H. Lieb
Journal of Combinatorial Theory
5
, 1968, pp. 203-206
A note on the arithmetic structure of the integers modulo
N
Thomas Storer
Journal of Combinatorial Theory
5
, 1968, pp. 207-209
Seiten 1
2
3
4
>