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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Enumeration under group action: Unsolved graphical enumeration problems, IV
Frank Harary
Journal of Combinatorial Theory
8
, 1970, pp. 1-11
Designs derived from permutation groups
Marshall, Jr. Hall
,
Richard Lane
,
David Wales
Journal of Combinatorial Theory
8
, 1970, pp. 12-22
Connectivity of transitive graphs
Mark E. Watkins
Journal of Combinatorial Theory
8
, 1970, pp. 23-29
Flows in infinite graphs
Jon Folkman
,
D.R. Fulkerson
Journal of Combinatorial Theory
8
, 1970, pp. 30-44
Toward a theory of crossing numbers
W.T. Tutte
Journal of Combinatorial Theory
8
, 1970, pp. 45-53
Remarks on the van der Waerden permanent conjecture
Andrew M. Gleason
Journal of Combinatorial Theory
8
, 1970, pp. 54-64
Numerical calculations on the four-color problem
Oystein Ore
,
Joel Stemple
Journal of Combinatorial Theory
8
, 1970, pp. 65-78
A generalization of the linear complementarity problem
Richard W. Cottle
,
George B. Dantzig
Journal of Combinatorial Theory
8
, 1970, pp. 79-90
Some covering concepts in graphs
Michael D. Plummer
Journal of Combinatorial Theory
8
, 1970, pp. 91-98
The distance between points in random trees
A. Meir
,
J.W. Moon
Journal of Combinatorial Theory
8
, 1970, pp. 99-103
A matching theorem for graphs
D. Kleitman
,
A. Martin-Löf
,
B. Rothschild
,
A. Whinston
Journal of Combinatorial Theory
8
, 1970, pp. 104-114
Heterogeneous algebras
Garrett Birkhoff
,
John D. Lipson
Journal of Combinatorial Theory
8
, 1970, pp. 115-133
Probability of pure equilibrium point in
n
-person games
Melvin Dresher
Journal of Combinatorial Theory
8
, 1970, pp. 134-145
Higher-dimensional analogs of the four-color problem and some inequalities for simplicial complexes
Branko Grünbaum
Journal of Combinatorial Theory
8
, 1970, pp. 147-153
The achromatic number of a graph
Frank Harary
,
Stephen Hedetniemi
Journal of Combinatorial Theory
8
, 1970, pp. 154-161
Operator theoretic invariants and the enumeration theory of Pólya and de Bruijn
S.G. Williamson
Journal of Combinatorial Theory
8
, 1970, pp. 162-169
Solution of the Heawood map-coloring problem-case 4
C.M. Terry
,
L.R. Welch
,
J.W.T. Youngs
Journal of Combinatorial Theory
8
, 1970, pp. 170-174
Solution of the Heawood map-coloring problem-cases 3, 5, 6, and 9
J.W.T. Youngs
Journal of Combinatorial Theory
8
, 1970, pp. 175-219
The Heawood map-coloring problem-cases 1, 7, and 10
J.W.T. Youngs
Journal of Combinatorial Theory
8
, 1970, pp. 220-231
A procedure for dissecting a rectangle into squares, and an example for the rectangle whose sides are in the ratio 2:1
R.L. Brooks
Journal of Combinatorial Theory
8
, 1970, pp. 232-243
Some simple perfect
2\times 1
rectangles
P.J. Federico
Journal of Combinatorial Theory
8
, 1970, pp. 244-246
On the number of orthogonal Latin squares
Haim Hanani
Journal of Combinatorial Theory
8
, 1970, pp. 247-271
A packing theory
David A. Klarner
Journal of Combinatorial Theory
8
, 1970, pp. 272-278
A combinatorial proof of Tucker's lemma for the
n
-cube
James K. Baker
Journal of Combinatorial Theory
8
, 1970, pp. 279-290
Enumeration of certain binary matrices
Douglas E. Jackson
,
R.C. Entringer
Journal of Combinatorial Theory
8
, 1970, pp. 291-298
Seiten 1
2
>