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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
When a three-way fabric hangs together
C.R.J. Clapham
Journal of Combinatorial Theory Series B
38
, 1985, pp. 190
An edge extremal result for subcohesion
F.T. Boesch
,
J.A.M. McHugh
Journal of Combinatorial Theory Series B
38
, 1985, pp. 1-7
The edge intersection graphs of paths in a tree
Martin Charles Golumbic
,
Robert E. Jamison
Journal of Combinatorial Theory Series B
38
, 1985, pp. 8-22
Stability in CAN-free graphs
P.L. Hammer
,
N.V.R. Mahadey
,
D. de Werra
Journal of Combinatorial Theory Series B
38
, 1985, pp. 23-30
A note on similar edges and edge-unique line graphs
David W. Bange
,
Anthony E. Barkauskas
,
Peter J. Slater
Journal of Combinatorial Theory Series B
38
, 1985, pp. 31-40
Polymatroid greedoids
Bernhard Korte
,
László Lovász
Journal of Combinatorial Theory Series B
38
, 1985, pp. 41-72
\lambda_1
, isoperimetric inequalities for graphs, and superconcentrators
N. Alon
,
V.D. Milman
Journal of Combinatorial Theory Series B
38
, 1985, pp. 73-88
A short note about pursuit games played on a graph with a given genus
A. Quilliot
Journal of Combinatorial Theory Series B
38
, 1985, pp. 89-92
Even edge colorings of a graph
Noga Alon
,
Yoshimi Egawa
Journal of Combinatorial Theory Series B
38
, 1985, pp. 93-94
Decompositions of digraphs into paths and cycles
Malaz Maamoun
Journal of Combinatorial Theory Series B
38
, 1985, pp. 97-101
Minimal
n
-fach zusammenhängende Digraphen
W. Mader
Journal of Combinatorial Theory Series B
38
, 1985, pp. 102-117
Long cycles in bipartite graphs
Bill Jackson
Journal of Combinatorial Theory Series B
38
, 1985, pp. 118-131
Reconstruction from vertex-switching
Richard P. Stanley
Journal of Combinatorial Theory Series B
38
(2), 1985, April, pp. 132-138
No graph has a maximal 3-ring of bonds
C.H.C. Little
,
D.A. Holton
Journal of Combinatorial Theory Series B
38
, 1985, pp. 139-142
On the graphical characterization of the projective space over a finite field
Minoru Numata
Journal of Combinatorial Theory Series B
38
, 1985, pp. 143-155
Interior graphs of maximal outerplane graphs
Sandra M. Hedetniemi
,
Andrzej Proskurowski
,
Maciej M. Sysƚo
Journal of Combinatorial Theory Series B
38
, 1985, pp. 156-167
Heawood's empire problem
Brad Jackson
,
Gerhard Ringel
Journal of Combinatorial Theory Series B
38
, 1985, pp. 168-178
Pendant tree-connectivity
Michael Hager
Journal of Combinatorial Theory Series B
38
, 1985, pp. 179-189
Distance-biregular graphs with 2-valent vertices and distance-regular line graphs
Bojan Mohar
,
John Shawe-Taylor
Journal of Combinatorial Theory Series B
38
, 1985, pp. 193-203
On color critical graphs
Vojtȇch Rödl
,
Zsolt Tuza
Journal of Combinatorial Theory Series B
38
, 1985, pp. 204-213
Quotients of connected regular graphs of even degree
Jozef S̑irán̑
,
Martin S̑koviera
Journal of Combinatorial Theory Series B
38
(3), 1985, June, pp. 214-225
The chromatic polynomial of an unlabeled graph
P. Hanlon
Journal of Combinatorial Theory Series B
38
, 1985, pp. 226-239
Graphs without
K_4
and well-quasi-ordering
Robin Thomas
Journal of Combinatorial Theory Series B
38
, 1985, pp. 240-247
Extremal subgraphs for two graphs
F.R.K. Chung
,
P. Erdŏs
,
J. Spencer
Journal of Combinatorial Theory Series B
38
, 1985, pp. 248-260
About some cyclic properties in digraphs
M.C. Heydemann
,
D. Sotteau
Journal of Combinatorial Theory Series B
38
, 1985, pp. 261-278
Seiten 1
2
>