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=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On optimal embeddings of metrics in graphs
Wilfried Imrich
,
J.M.S. Simões-Pereira
,
Christina M. Zamfirescu
Journal of Combinatorial Theory Series B
36
(1), 1984, February, pp. 1-15
Graph decompositions without isolates
Nathan Linial
Journal of Combinatorial Theory Series B
36
, 1984, pp. 16-25
The acyclic sets of an oriented matroid
Paul H. Edelman
Journal of Combinatorial Theory Series B
36
, 1984, pp. 26-31
Large graphs with given degree and diameter. II
J.C. Bermond
,
C. Delorme
,
G. Farhi
Journal of Combinatorial Theory Series B
36
(1), 1984, February, pp. 32-48
Graph minors. III. Planar tree-width
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
36
(1), 1984, pp. 49-64
Embedding graphs in surfaces
Peter Hoffman
,
Bruce Richter
Journal of Combinatorial Theory Series B
36
, 1984, pp. 65-84
A sufficient condition for a graph to be weakly
k
-linked
Tomio Hirata
,
Kiyohito Kubota
,
Osami Saito
Journal of Combinatorial Theory Series B
36
, 1984, pp. 85-94
Rigidity of multi-graphs. I. Linking rigid bodies in
n
-space
Tiong-Seng Tay
Journal of Combinatorial Theory Series B
36
, 1984, pp. 95-112
Matchings in graphs of size
\aleph_1
Ron Aharoni
Journal of Combinatorial Theory Series B
36
, 1984, pp. 113-117
On the number of rooted
c
-nets
Liu Yanpei
Journal of Combinatorial Theory Series B
36
, 1984, pp. 118-123
Hamiltonian decompositions of complete graphs
A.J.W. Hilton
Journal of Combinatorial Theory Series B
36
, 1984, pp. 125-134
On the minimum order of graphs with given semigroup
Václav Koubek
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
36
, 1984, pp. 135-155
On the chromatic index of multigraphs without large triangles
Henry A. Kierstead
Journal of Combinatorial Theory Series B
36
, 1984, pp. 156-160
Testing membership in matroid polyhedra
William H. Cunningham
Journal of Combinatorial Theory Series B
36
(2), 1984, April, pp. 161-188
Uniquely and faithfully embeddable projective-planar triangulations
Seiya Negami
Journal of Combinatorial Theory Series B
36
, 1984, pp. 189-193
Even signings, signed switching classes, and (-1,1)-matrices
Albert L., Jr. Wells
Journal of Combinatorial Theory Series B
36
(2), 1984, April, pp. 194-212
A variation of Menger's theorem for long paths
L. Montejano
,
V. Neumann-Lara
Journal of Combinatorial Theory Series B
36
, 1984, pp. 213-217
A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs
Han-Kun Ma
Journal of Combinatorial Theory Series B
36
, 1984, pp. 218-219
Finding feasible vectors of Edmonds-Giles polyhedra
András Frank
Journal of Combinatorial Theory Series B
36
, 1984, pp. 221-239
A bound for the number of tournaments with specified scores
Peter M. Gibson
Journal of Combinatorial Theory Series B
36
, 1984, pp. 240-243
A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs
Thomas W. Tucker
Journal of Combinatorial Theory Series B
36
(3), 1984, June, pp. 244-268
There is one group of genus two
Thomas W. Tucker
Journal of Combinatorial Theory Series B
36
, 1984, pp. 269-275
The asymptotic enumeration of rooted convex polyhedra
Edward A. Bender
,
L. Bruce Richmond
Journal of Combinatorial Theory Series B
36
, 1984, pp. 276-283
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
J. Plesník
Journal of Combinatorial Theory Series B
36
(3), 1984, June, pp. 284-297
Duality and perfection for edges in cliques
Michael O. Albertson
,
Karen L. Collins
Journal of Combinatorial Theory Series B
36
, 1984, pp. 298-309