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 YEAR=1982
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
Completely strong path-connected tournaments
Zhang Ke-Min
Journal of Combinatorial Theory Series B
33
, 1982, pp. 166-177
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
Extending an extension of Grinberg's theorem
Joseph Zaks
Journal of Combinatorial Theory Series B
32
, 1982, pp. 95-98
Longest cycles in
r
-regular
r
-connected graphs
Brad Jackson
,
T.D. Parsons
Journal of Combinatorial Theory Series B
32
, 1982, pp. 231-245
Extremals of functions on graphs with applications to graphs and hypergraphs
Vera T. Sós
,
E.G. Straus
Journal of Combinatorial Theory Series B
32
, 1982, pp. 246-257
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
Thomas Andreae
Journal of Combinatorial Theory Series B
32
, 1982, pp. 258-263
Graphs having circuits with at least two chords
Heinz-Jürgen Voss
Journal of Combinatorial Theory Series B
32
, 1982, pp. 264-285
Ordered colourings of graphs
E.J. Cockayne
,
A.G. Thomason
Journal of Combinatorial Theory Series B
32
, 1982, pp. 286-292
Couplages et transversaux généralisés d'un hypergraphe infini
Norbert Polat
Journal of Combinatorial Theory Series B
32
, 1982, pp. 293-315
Constructing a covering triangulation by means of a nowhere-zero dual flow
André Bouchet
Journal of Combinatorial Theory Series B
32
, 1982, pp. 316-325
Obstructions for regular colorings
D. de Werra
Journal of Combinatorial Theory Series B
32
, 1982, pp. 326-335
A class of vertex-transitive digraphs, II
Chong-Yun Chao
,
Jacqueline G. Wells
Journal of Combinatorial Theory Series B
32
, 1982, pp. 336-346
Graphes orientés indécomposables en circuits hamiltoniens
J. Aubert
,
B. Schneider
Journal of Combinatorial Theory Series B
32
, 1982, pp. 347-349
Seiten 1
2
>