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=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Balanced decompositions of a signed graph
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 1-13
Distance-regularised graphs are distance-regular or distance-biregular
Chris D. Godsil
,
John Shawe-Taylor
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 14-24
An additivity theorem for the genus of a graph
Gary L. Miller
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 25-47
On the non-orientable genus of a 2-connected graph
R. Bruce Richter
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 48-59
On the Euler genus of a 2-connected graph
R. Bruce Richter
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 60-69
Decomposition of perfect graphs
Wen-Lian Hsu
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 70-94
Nowhere-zero integral chains and flows in bidirected graphs
A. Khelladi
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 95-115
A characterization of locally finite vertex-transitive graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 116-119
Parity graphs are kernel-
M
-solvable
Pierre Duchet
Journal of Combinatorial Theory Series B
43
, 1987, pp. 121-126
Local
k
-colorings of graphs and hypergraphs
A. Gyárfás
,
J. Lehel
,
J. Nes̑etȓil
,
V. Rödl
,
R.H. Schelp
,
Zs. Tuza
Journal of Combinatorial Theory Series B
43
, 1987, pp. 127-139
Strict refinement for graphs and digraphs
James W. Walker
Journal of Combinatorial Theory Series B
43
, 1987, pp. 140-150
A reduction procedure for coloring perfect
K_4
-free graphs
Alan Tucker
Journal of Combinatorial Theory Series B
43
, 1987, pp. 151-172
Oriented matroids from smooth manifolds
Douglas A. Miller
Journal of Combinatorial Theory Series B
43
, 1987, pp. 173-186
Matching structure and the matching lattice
László Lovász
Journal of Combinatorial Theory Series B
43
, 1987, pp. 187-222
A semi-strong perfect graph theorem
B. Reed
Journal of Combinatorial Theory Series B
43
(2), 1987, October, pp. 223-240
A remark on embedded bipartite graphs
Gadi Moran
Journal of Combinatorial Theory Series B
43
(2), 1987, October, pp. 241-243
A Chvátal-Erdŏs condition for Hamilton Cycles in digraphs
Bill Jackson
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 245-252
Relation fonctionelles et dénombrement des cartes pointées sur le tore
Didier Arquès
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 253-274
Hypercartes pointées sur le tore: Décomposition et dénombrement
Didier Arquès
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 275-286
On the genus and thickness of graphs
Kouhei Asano
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 287-292
Distance-regular digraphs of girth 4
H. Enomoto
,
R.A. Mena
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 293-302
Menger's theorem for countable graphs
Ron Aharoni
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 303-313
A circuit set characterization of antimatroids
Brenda L. Dietrich
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 314-321
Amalgamations of almost regular edge-colourings of simple graphs
C.St.J.A. Nash-Williams
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 322-342
A note on minimal directed graphs with given girth
Yahya Ould Hamidoune
Journal of Combinatorial Theory Series B
43
(3), 1987, December, pp. 343-348
Seiten 1
2
>