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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamilton cycles in Euler tour graph
Fu-ji Zhang
,
Xiao-Fong Guo
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 1-8
Interval representations of planar graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 9-20
Concerning the achromatic number of graphs
Martin Farber
,
Gen̆a Hahn
,
Pavol Hell
,
Donald Miller
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 21-39
On the cycle polytope of a binary matroid
F. Barahona
,
M. Grötschel
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 40-62
An integer analogue of Carathéodory's theorem
W. Cook
,
J. Fonlupt
,
A. Schrijver
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 63-70
The chromatic index of nearly bipartite multigraphs
Larry Eggan
,
Michael Plantholt
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 71-80
Representing abstract groups by powers of a graph
Walter Vogler
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 81-93
A common cover of graphs and 2-cell embeddings
Bojan Mohar
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 94-106
Cayley digraphs of prime-power order are Hamiltonian
Dave Witte
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 107-112
Spectral bounds for the clique and independence numbers of graphs
Herbert S. Wilf
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 113-117
Symmetry groups related to the construction of perfect one factorizations of
K_{2n}
Edwin C. Ihrig
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 121-151
Kritisch
n
-fach kantenzusammenhängende Graphen
W. Mader
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 152-158
Minimally 3-connected graphs
Robin W. Dawes
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 159-168
Switching classes of direct graphs
Ying Cheng
,
Albert L., Jr. Wells
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 169-186
An exact threshold theorem for random graphs and the node-packing problem
G.R. Grimmett
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 187-195
Maximum matchings in a class of random graphs
A.M. Frieze
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 196-212
A class of distance-regular graphs that are
Q
-polynomial
Paul Terwilliger
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 213-223
Perfect codes over graphs
Jan Kratochvíl
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 224-228
Proof of the strong 2-cover conjecture for planar graphs
Herbert Fleischner
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 229-230
Sphericity exceeds cubicity for almost all complete bipartite graphs
Hiroshi Maehara
Journal of Combinatorial Theory Series B
40
(2), 1986, April, pp. 231-235
Directed switching games on graphs and matroids
Yahya Ould Hamidoune
,
M. las Vergnas
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 237-269
Extremal problems concerning Kneser graphs
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 270-284
An extension of matching theory
Gérard Cornuéjols
,
David Hartvigsen
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 285-296
A survey of the asymptotic behaviour of maps
Edward A. Bender
,
L. Bruce Richmond
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 297-329
Relaxations of vertex packing
M. Grötschel
,
L. Lovász
,
A. Schrijver
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 330-343
Seiten 1
2
>