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 Series B AND Volume=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rings of bonds in graphs
C.H.C. Little
,
D.A. Holton
Journal of Combinatorial Theory Series B
33
, 1982, pp. 1-6
A Ramsey-type theorem for traceable graphs
F. Galvin
,
I. Rival
,
B. Sands
Journal of Combinatorial Theory Series B
33
, 1982, pp. 7-16
On the points-lines-planes conjecture
P.D. Seymour
Journal of Combinatorial Theory Series B
33
, 1982, pp. 17-26
On the Ramsey numbers
R(3,8)
and
R(3,9)
Charles M. Grinstead
,
Sam M. Roberts
Journal of Combinatorial Theory Series B
33
, 1982, pp. 27-51
Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
B. Devadas Acharya
,
Michel las Vergnas
Journal of Combinatorial Theory Series B
33
, 1982, pp. 52-56
The toroidal thickness of the symmetric quadripartite graph
Ian Anderson
Journal of Combinatorial Theory Series B
33
, 1982, pp. 57-59
Theory of annihilation games-I
A.S. Fraenkel
,
Y. Yesha
Journal of Combinatorial Theory Series B
33
, 1982, pp. 60-86
On external activity and inversions in trees
Janet Simpson Beissinger
Journal of Combinatorial Theory Series B
33
, 1982, pp. 87-92
The basis number of the
n
-cube
John Anthony Banks
,
Edward F. Schmeichel
Journal of Combinatorial Theory Series B
33
, 1982, pp. 95-100
Shortness exponents for polytopes which are
k
-gonal modulo
n
Monika Schmidt
,
Tudor Zamfirescu
Journal of Combinatorial Theory Series B
33
, 1982, pp. 101-120
Some general constructions of geodetic blocks
K.R. Parthasarathy
,
N. Srinivasan
Journal of Combinatorial Theory Series B
33
, 1982, pp. 121-136
Duality of infinite graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
33
(2), 1982, October, pp. 137-160
Upper bound on the order of
\tau
-critical hypergraphs
A. Gyárfás
,
J. Lehel
,
Zs. Tuza
Journal of Combinatorial Theory Series B
33
(2), 1982, October, pp. 161-165
Completely strong path-connected tournaments
Zhang Ke-Min
Journal of Combinatorial Theory Series B
33
, 1982, pp. 166-177
An edge-deletion problem for locally finite graphs
Thomas Andreae
Journal of Combinatorial Theory Series B
33
(2), 1982, October, pp. 178-186
Meyniel graphs are strongly perfect
G. Ravindra
Journal of Combinatorial Theory Series B
33
, 1982, pp. 187-190
Triangle free graphs that are not
\sqrt{3}
-embeddable in
S^d
Moshe Rosenfeld
Journal of Combinatorial Theory Series B
33
, 1982, pp. 191-195
On the existence of certain distance regular graphs
C. Roos
,
A.J. van Zanten
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 197-212
Characterization of the graphs of the Johnson schemes
G(3k,k)
and
G(3k+1,k)
Aeryung Moon
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 213-221
Generating the triangulations of the projective plane
David Barnette
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 222-230
Finite common coverings of graphs
Frank Thomson Leighton
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 231-238
The lattice of convex sets of an oriented matroid
Paul H. Edelman
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 239-244
Cycles of each length in tournaments
Tian Feng
,
Wu Zheng-Sheng
,
Zhang Cun-Quan
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 245-255
On the uniqueness of the graphs
G(n,k)
of the Johnson schemes
Aeryung Moon
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 256-264
The dichromatic number of a digraph
V. Neumann-Lara
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 265-270
Seiten 1
2
>