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=1967
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the powers of tournament matrices
J.W. Moon
,
N.J. Pullman
Journal of Combinatorial Theory
3
, 1967, pp. 1-9
Die Dicke des
n
-dimensionalen Würfel-Graphen
Michael Kleinert
Journal of Combinatorial Theory
3
, 1967, pp. 10-15
On basis digraphs
Ram Prakash Gupta
Journal of Combinatorial Theory
3
, 1967, pp. 16-24
On the inequality
\sum x_iy_i \geq 1/n\sum x_i \sum y_i
and the van der Waerden permanent conjecture
D.W. Sasser
,
M.L. Slater
Journal of Combinatorial Theory
3
, 1967, pp. 25-33
A maximum principle for graphs
R.C. Lyndon
Journal of Combinatorial Theory
3
, 1967, pp. 34-37
A coarseness conjecture of Erdŏs
Richard K. Guy
Journal of Combinatorial Theory
3
, 1967, pp. 38-42
An application of a theorem of de Bruijn, Tengbergen and Kruyswijk
Ian Anderson
Journal of Combinatorial Theory
3
, 1967, pp. 43-47
The number of classes of linearly equivalent functions
Daniel Fendel
Journal of Combinatorial Theory
3
, 1967, pp. 48-53
Some squared squares and rectangles
T.H. Willcocks
Journal of Combinatorial Theory
3
, 1967, pp. 54-56
Extrema concerning asymmetric graphs
Louis V. Quintas
Journal of Combinatorial Theory
3
, 1967, pp. 57-82
Barrage d'un espace cartésian à l'aide d'orthants aplatis
Germain Kreweras
Journal of Combinatorial Theory
3
, 1967, pp. 83-92
Some functional equations related to binomial coefficient summations
L. Carlitz
Journal of Combinatorial Theory
3
, 1967, pp. 93-97
The number of Latin squares of order eight
Mark B. Wells
Journal of Combinatorial Theory
3
, 1967, pp. 98-99
A generalization of a partition theorem of MacMahon
George E. Andrews
Journal of Combinatorial Theory
3
, 1967, pp. 100-101
On the average activity of a spanning tree of a rooted map
R.C. Mullin
Journal of Combinatorial Theory
3
, 1967, pp. 103-121
The number of idempotent elements in symmetric semigroups
Bernard Harris
,
Lowell Schoenfeld
Journal of Combinatorial Theory
3
, 1967, pp. 122-135
Point-symmetric graphs with a prime number of points
James Turner
Journal of Combinatorial Theory
3
, 1967, pp. 136-145
On Jacobi sums and difference sets
Koichi Yamamoto
Journal of Combinatorial Theory
3
, 1967, pp. 146-181
On a conjecture of Rademacher, Dickson, and Plotkin
N.H. Bingham
,
J.M. Hammersley
Journal of Combinatorial Theory
3
, 1967, pp. 182-190
On a class of
(0,1)
matrices with vanishing determinants
N. Metropolis
,
P.R. Stein
Journal of Combinatorial Theory
3
, 1967, pp. 191-198
Characterization of line graphs
D.K. Ray-Chaudhuri
Journal of Combinatorial Theory
3
, 1967, pp. 201-214
Regular line-symmetric graphs
Jon Folkman
Journal of Combinatorial Theory
3
, 1967, pp. 215-232
Two addition theorems
H.B. Mann
Journal of Combinatorial Theory
3
, 1967, pp. 233-235
A combinatorial property of spanning forests in connected graphs
R.C. Mullin
,
R.G. Stanton
Journal of Combinatorial Theory
3
, 1967, pp. 236-243
Cooperative classes of finite sets in one and more dimensions
Theodore S. Motzkin
Journal of Combinatorial Theory
3
, 1967, pp. 244-251
Seiten 1
2
3
4
>