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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebras defined by patterns of zeros
Robert L. Davis
Journal of Combinatorial Theory
9
, 1970, pp. 257-260
Group transitivity and a multiplicative function of a partition
H.O. Foulkes
Journal of Combinatorial Theory
9
, 1970, pp. 261-266
On
n
-uniform Hjelmslev planes
David A. Drake
Journal of Combinatorial Theory
9
, 1970, pp. 267-288
On chromatic polynomials and the golden ratio
W.T. Tutte
Journal of Combinatorial Theory
9
, 1970, pp. 289-296
Graphs with circulant adjacency matrices
Bernard Elspas
,
James Turner
Journal of Combinatorial Theory
9
, 1970, pp. 297-307
n
-Hamiltonian graphs
Gary Chartrand
,
S.F. Kapoor
,
Don R. Lick
Journal of Combinatorial Theory
9
, 1970, pp. 308-312
The crossing number of
K_{5,n}
Daniel J. Kleitman
Journal of Combinatorial Theory
9
, 1970, pp. 315-323
On nonreconstructable tournaments
L.W. Beineke
,
E.T. Parker
Journal of Combinatorial Theory
9
, 1970, pp. 324-326
Enumeration of non-separable graphs
Robert W. Robinson
Journal of Combinatorial Theory
9
, 1970, pp. 327-356
A rank inequality for finite geometric lattices
Curtis Greene
Journal of Combinatorial Theory
9
, 1970, pp. 357-364
An elementary solution to a problem in restricted partitions
N. Metropolis
,
P.R. Stein
Journal of Combinatorial Theory
9
, 1970, pp. 365-376
Symmetric embeddings of graphs
D.F. Robinson
Journal of Combinatorial Theory
9
, 1970, pp. 377-400
Correspondences between plane trees and binary sequences
David A. Klarner
Journal of Combinatorial Theory
9
, 1970, pp. 401-411
The number of classes of isomorphic graded partially ordered sets
David A. Klarner
Journal of Combinatorial Theory
9
, 1970, pp. 412-419
Regular
d
-valent graphs of girth 6 and
2(d^2-d+1)
vertices
Judith Q. Longyear
Journal of Combinatorial Theory
9
, 1970, pp. 420-422
On the factorisation of the complete graph into factors of diameter 2
Norbert Sauer
Journal of Combinatorial Theory
9
, 1970, pp. 423-426
Seiten
<
1
2