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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
k
-leaf-connected graphs
M.A. Gurgel
,
Y. Wakabayashi
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 1-16
Longest cycles in 3-connected cubic graphs
Bill Jackson
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 17-26
Factors of regular graphs
Mikio Kano
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 27-36
On a pursuit game played on graphs for which a minor is excluded
Thomas Andreae
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 37-47
Proportional transitivity in linear extensions of ordered sets
P.C. Fishburn
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 48-60
Maximum induced trees in graphs
Paul Erdŏs
,
Michael Saks
,
Vera T. Sós
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 61-79
The number of matchings in random regular graphs and bipartite graphs
B. Bollobás
,
B.D. McKay
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 80-91
Graph minors. V. Excluding a planar graph
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 92-114
Graph minors. VI. Disjoint paths across a disc
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
41
(1), 1986, August, pp. 115-138
Intersection graphs of paths in a tree
Clyde L. Monma
,
Victor K. Wei
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 141-181
Distance-hereditary graphs
Hans-Jürgen Bandelt
,
Henry Martyn Mulder
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 182-208
Hypertrees and Bonferroni inequalities
Ioan Tomescu
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 209-217
Geodetic graphs of diameter two and some related structures
Raffaele Scapellato
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 218-229
Graphs determined by their finite induced subgraphs
H.D. Macpherson
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 230-234
Similarity reconstruction of trees
R. Taylor
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 235-245
Order properties of lines in the plane and a conjecture of G. Ringel
M. las Vergnas
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 246-249
On the matroids representable over
GF(4)
James G. Oxley
Journal of Combinatorial Theory Series B
41
(2), 1986, October, pp. 250-252
Distance-transitive representations of the symmetric groups
A.A. Ivanov
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 255-274
A decomposition theory for matroids. III. Decomposition conditions
K. Truemper
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 275-305
On the chromatic index of multigraphs and a conjecture of Seymour (I)
Odile Marcotte
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 306-331
Semi-duality and the cycle double cover conjecture
Michael Tarsi
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 332-340
Infinite paths that contain only shortest paths
Mark E. Watkins
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 341-355
Partition properties of
q
-hypergraphs
Hans Jürgen Prömel
Journal of Combinatorial Theory Series B
41
(3), 1986, December, pp. 356-385