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=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
R.L. Graham
Journal of Combinatorial Theory
4
, 1968, pp. 300
An inequality for the chromatic number of a graph
G. Szekeres
,
Herbert S. Wilf
Journal of Combinatorial Theory
4
, 1968, pp. 1-3
Directed graphs having all bisections
Paul Kelley
,
David Merriell
Journal of Combinatorial Theory
4
, 1968, pp. 4-18
Parallel minimax search for a maximum
Richard M. Karp
,
Willard L. Miranker
Journal of Combinatorial Theory
4
, 1968, pp. 19-35
On a min-max problem of Leo Moser
G.F. Clements
Journal of Combinatorial Theory
4
, 1968, pp. 36-39
Shadows of finite sets
Theodore S. Motzkin
Journal of Combinatorial Theory
4
, 1968, pp. 40-48
On the non-existence of graphs with transitive generalized dicyclic groups
Lewis A. Nowitz
Journal of Combinatorial Theory
4
, 1968, pp. 49-51
An introduction to chromatic polynomials
Ronald C. Read
Journal of Combinatorial Theory
4
, 1968, pp. 52-71
Notes on plane partitions. I
Basil Gordon
,
Lorne Houten
Journal of Combinatorial Theory
4
, 1968, pp. 72-80
Notes on plane partitions. II
Basil Gordon
,
Lorne Houten
Journal of Combinatorial Theory
4
, 1968, pp. 81-99
On planar geodetic graphs
Joel G. Stemple
,
Mark E. Watkins
Journal of Combinatorial Theory
4
, 1968, pp. 101-117
A theorem on cross-classification
Basil Gordon
,
Theodore S. Motzkin
Journal of Combinatorial Theory
4
, 1968, pp. 118-120
Fibonacci and binomial properties of weighted compositions
V.E., Jr. Hoggatt
,
D.A. Lind
Journal of Combinatorial Theory
4
, 1968, pp. 121-124
Some graph theoretic results associated with Ramsey's theorem
Jack E. Graver
,
James Yackel
Journal of Combinatorial Theory
4
, 1968, pp. 125-175
Optimal assignments in an ordered set; an application of matroid theory
David Gale
Journal of Combinatorial Theory
4
, 1968, pp. 176-180
Enumeration of colored graphs
R.W. Robinson
Journal of Combinatorial Theory
4
, 1968, pp. 181-190
A note on a
q
-extension of ballot numbers
John Riordan
Journal of Combinatorial Theory
4
, 1968, pp. 191-193
Divisibility properties of the permanent function
Herbert Wilf
Journal of Combinatorial Theory
4
, 1968, pp. 194-197
Permanents by Möbius inversion
Henry H. Crapo
Journal of Combinatorial Theory
4
, 1968, pp. 198-200
Maximal subsemigroups of finite semigroups
N. Graham
,
R. Graham
,
J. Rhodes
Journal of Combinatorial Theory
4
, 1968, pp. 203-209
On the structure of orthomodular lattices satisfying the chain condition
R.J. Greechie
Journal of Combinatorial Theory
4
, 1968, pp. 210-218
On an enumeration problem
M.P. Schützenberger
Journal of Combinatorial Theory
4
, 1968, pp. 219-221
Complexity of grammars by group theoretic methods
John Rhodes
,
Eliahu Shamir
Journal of Combinatorial Theory
4
, 1968, pp. 222-239
Note on the visual hull of a set
W.A. Beyer
,
S.M. Ulam
Journal of Combinatorial Theory
4
, 1968, pp. 240-245
A mechanical counting method and combinatorial applications
Herbert S. Wilf
Journal of Combinatorial Theory
4
, 1968, pp. 246-258
Seiten 1
2
>