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=2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An orthogonality theorem of Dines related to moment problems and linear programming
R.J. Duffin
Journal of Combinatorial Theory
2
, 1967, pp. 1-26
A note on plane trees
N.G. de Bruijn
,
B.J.M. Morselt
Journal of Combinatorial Theory
2
, 1967, pp. 27-34
Upper bounds for some Ramsey numbers
J.G. Kalbfleisch
Journal of Combinatorial Theory
2
, 1967, pp. 35-42
The genus of
K_{12s}
C.M. Terry
,
L.R. Welch
,
J.W.T. Youngs
Journal of Combinatorial Theory
2
, 1967, pp. 43-60
On the disproof of spectral synthesis
Ian Richards
Journal of Combinatorial Theory
2
, 1967, pp. 61-70
On canonical bases of ideals
Henry B. Mann
,
Koichi Yamamoto
Journal of Combinatorial Theory
2
, 1967, pp. 71-76
Some theorems on the free groups of certain product varieties
Gilbert Baumslag
Journal of Combinatorial Theory
2
, 1967, pp. 77-99
Partial patterns on even triangulated polygons
Norman C. Dalkey
Journal of Combinatorial Theory
2
, 1967, pp. 100-102
A characterization of planar geodetic graphs
Mark E. Watkins
Journal of Combinatorial Theory
2
, 1967, pp. 102-103
Limit theorems for transient Markov chains
Sidney C. Port
Journal of Combinatorial Theory
2
, 1967, pp. 107-128
On a relation between labeled graphs and permutations
Murray Eden
Journal of Combinatorial Theory
2
, 1967, pp. 129-134
Kronecker products of fully indecomposable matrices and of ultrastrong digraphs
Richard A. Brualdi
Journal of Combinatorial Theory
2
, 1967, pp. 135-139
On free alternative rings
Margaret M. Humm
,
Erwin Kleinfeld
Journal of Combinatorial Theory
2
, 1967, pp. 140-144
Some inequalities for combinatorial matrix functions
Marvin Marcus
,
George W. Soules
Journal of Combinatorial Theory
2
, 1967, pp. 145-163
A theorem of three-coloring the edges of a trivalent graph
George J. Minty
Journal of Combinatorial Theory
2
, 1967, pp. 164-167
Zum Basisproblem für Graphenmengen, insbesondere für die nicht in die projektive Ebene einbettbaren Graphen
K. Wagner
Journal of Combinatorial Theory
2
, 1967, pp. 168-185
A simple new method for calculating the characters of the symmetric groups
Ronald Forrest Fox
Journal of Combinatorial Theory
2
, 1967, pp. 186-212
Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
Haya Friedman
,
Dov Tamari
Journal of Combinatorial Theory
2
, 1967, pp. 215-242
On tactical configuration and error-correcting codes
E.F., Jr. Assmus
,
H.F., Jr. Mattson
Journal of Combinatorial Theory
2
, 1967, pp. 243-257
Lengths of snakes in boxes
Ludwig Danzer
,
Victor Klee
Journal of Combinatorial Theory
2
, 1967, pp. 258-265
An enumeration of the sets of non-interfering arithmetic progressions with specified periods
Edward A. Fay
Journal of Combinatorial Theory
2
, 1967, pp. 266-274
Sums of sets in the elementary Abelian group of type
(p,p)
Henry B. Mann
,
John E. Olson
Journal of Combinatorial Theory
2
, 1967, pp. 275-285
On the 1-factors of a non-separable graph
Lowell W. Beineke
,
Michael D. Plummer
Journal of Combinatorial Theory
2
, 1967, pp. 286-289
The square root of a graph
A. Mukhopadhyay
Journal of Combinatorial Theory
2
, 1967, pp. 290-295
On the unique determination of the cyclotomic numbers for Galois fields and Galois domains
Thomas Storer
Journal of Combinatorial Theory
2
, 1967, pp. 296-300
Seiten 1
2
>