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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounds assuring subsets in convex position
Theodore S. Motzkin
,
P.E. O'Neil
Journal of Combinatorial Theory
3
, 1967, pp. 252-255
Excessive functions of continuous time Markov chains
John G. Kemeny
,
J. Laurie Snell
Journal of Combinatorial Theory
3
, 1967, pp. 256-278
Extensions of the birthday surprise
M.S. Klamkin
,
D.J. Newman
Journal of Combinatorial Theory
3
, 1967, pp. 279-282
A result in balanced incomplete block designs
E.T. Parker
Journal of Combinatorial Theory
3
, 1967, pp. 283-285
Infinite graphs-A survey
C.St.J.A. Nash-Williams
Journal of Combinatorial Theory
3
, 1967, pp. 286-301
Representatives of subsets
R.L. Perry
Journal of Combinatorial Theory
3
, 1967, pp. 302-304
On Dilworth's decomposition theorem for partially ordered sets
Helge Tverberg
Journal of Combinatorial Theory
3
, 1967, pp. 305-306
Oriented subtrees of an arc digraph
Donald E. Knuth
Journal of Combinatorial Theory
3
, 1967, pp. 309-314
The football pool problem for 5 matches
H.J.L. Kamps
,
J.H. van Lint
Journal of Combinatorial Theory
3
, 1967, pp. 315-325
Fastplättbare Graphen
K. Wagner
Journal of Combinatorial Theory
3
, 1967, pp. 326-365
A characterization of tetrahedral graphs
R.C. Bose
,
Renu Laskar
Journal of Combinatorial Theory
3
, 1967, pp. 366-385
A characterization of cubic lattice graphs
Renu Laskar
Journal of Combinatorial Theory
3
, 1967, pp. 386-401
A geometric characterization of the line graph of a projective plane
T.A. Dowling
,
Renu Laskar
Journal of Combinatorial Theory
3
, 1967, pp. 402-410
Seiten
<
1
2