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.
N(4,4;3) \geq 13
John R. Isbell
Journal of Combinatorial Theory
6
, 1969, pp. 210
über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
Hansjoachim Walther
Journal of Combinatorial Theory
6
, 1969, pp. 1-6
An inversion problem associated with compositions
G. Stell
Journal of Combinatorial Theory
6
, 1969, pp. 7-11
The number of graded partially ordered sets
David A. Klarner
Journal of Combinatorial Theory
6
, 1969, pp. 12-19
Matching algorithms
Donald R. Morrison
Journal of Combinatorial Theory
6
, 1969, pp. 20-32
Steiner triple systems and strongly regular graphs
I.S̑.O. Aliev
,
Esther Seiden
Journal of Combinatorial Theory
6
, 1969, pp. 33-39
A class of Hadamard matrices
Jennifer Wallis
Journal of Combinatorial Theory
6
, 1969, pp. 40-44
A characterization problem in graph theory
Martin Aigner
Journal of Combinatorial Theory
6
, 1969, pp. 45-55
An elementary proof of
p(11m+6) \equiv 0 \pmod{11}
Lasse Winquist
Journal of Combinatorial Theory
6
, 1969, pp. 56-59
Labeled trees with unlabeled end-points
Frank Harary
,
Abbe Mowshowitz
,
John Riordan
Journal of Combinatorial Theory
6
, 1969, pp. 60-64
Connected graphs with unlabeled end-points
J.W. Moon
Journal of Combinatorial Theory
6
, 1969, pp. 65-66
Characters and complexity of finite semigroups
John Rhodes
Journal of Combinatorial Theory
6
, 1969, pp. 67-85
The number of
s
-dimensional faces in a complex: An analogy between the simplex and the cube
J.B. Kruskal
Journal of Combinatorial Theory
6
, 1969, pp. 86-89
On a paper of Fox about a method for calculating the ordinary irreducible characters of symmetric groups
Adalbert Kerber
Journal of Combinatorial Theory
6
, 1969, pp. 90-93
On free monoids partially ordered by embedding
Leonard H. Haines
Journal of Combinatorial Theory
6
, 1969, pp. 94-98
A note on the enumeration of line chromatic trees
L. Carlitz
Journal of Combinatorial Theory
6
, 1969, pp. 99-101
On the number of certain lattice polygons
G. Pólya
Journal of Combinatorial Theory
6
, 1969, pp. 102-105
Sur les zeros d'une classe de polynomes liés aux graphes et multigraphes values positivement
Germain Kreweras
Journal of Combinatorial Theory
6
, 1969, pp. 107-121
New 5-designs
E.F., Jr. Assmus
,
H.F., Jr. Mattson
Journal of Combinatorial Theory
6
, 1969, pp. 122-151
A theorem on Tait coloring with an application to the generalized Petersen graphs
Mark E. Watkins
Journal of Combinatorial Theory
6
, 1969, pp. 152-164
On direction-preserving maps of graphs
David G. Cantor
,
Bernard Dimsdale
Journal of Combinatorial Theory
6
, 1969, pp. 165-176
Le problème des régions voisines sur les surfaces closes orientables
Jean Mayer
Journal of Combinatorial Theory
6
, 1969, pp. 177-195
The number of labeled
k
-trees
J.W. Moon
Journal of Combinatorial Theory
6
, 1969, pp. 196-199
The number of labeled
k
-dimensional trees
L.W. Beineke
,
R.E. Pippert
Journal of Combinatorial Theory
6
, 1969, pp. 200-205
On the number of labeled 2-trees
Edgar M. Palmer
Journal of Combinatorial Theory
6
, 1969, pp. 206-207
Seiten 1
2
3
>