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 YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unfriendly partitions of a graph
R. Aharoni
,
E.C. Milner
,
K. Prikry
Journal of Combinatorial Theory Series B
50
, 1990, pp. 1-10
Sur un nouvel invariant des graphes et un critère de planarité
Yves Colin de Verdière
Journal of Combinatorial Theory Series B
50
, 1990, pp. 11-21
Locally perfect graphs
Myriam Preissmann
Journal of Combinatorial Theory Series B
50
, 1990, pp. 22-40
The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics
Joseph P.S. Kung
Journal of Combinatorial Theory Series B
50
, 1990, pp. 41-53
Symmetric matroids
Gil Kalai
Journal of Combinatorial Theory Series B
50
, 1990, pp. 54-64
Quantizers and the worst-case Euclidean traveling salesman problem
Luis A. Goddyn
Journal of Combinatorial Theory Series B
50
, 1990, pp. 65-81
LP duality in infinite hypergraphs
Ron Aharoni
,
Ran Ziv
Journal of Combinatorial Theory Series B
50
, 1990, pp. 82-92
Simplicial tree-decompositions of infinite graphs II. The existence of prime decompositions
Reinhard Diestel
Journal of Combinatorial Theory Series B
50
, 1990, pp. 93-116
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions
Reinhard Diestel
Journal of Combinatorial Theory Series B
50
, 1990, pp. 117-128
An upper bound for the transversal numbers of 4-uniform hypergraphs
Feng-Chu Lai
,
Gerard J. Chang
Journal of Combinatorial Theory Series B
50
, 1990, pp. 129-133
Lifting map automorphisms and MacBeath's theorem
David B. Surowski
Journal of Combinatorial Theory Series B
50
, 1990, pp. 135-149
An intersection theorem for supermatroids
éva Tardos
Journal of Combinatorial Theory Series B
50
, 1990, pp. 150-159
Distance-regular graphs of Hamming type
Kazumasa Nomura
Journal of Combinatorial Theory Series B
50
, 1990, pp. 160-167
Counting 1-factors in infinite graphs
Ron Aharoni
,
Mao Lin Zheng
Journal of Combinatorial Theory Series B
50
, 1990, pp. 168-178
Isometric embeddings in Hamming graphs
Elke Wilkeit
Journal of Combinatorial Theory Series B
50
, 1990, pp. 179-197
Bidirectional rectracting-free double tracings and upper embeddability of graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
50
, 1990, pp. 198-207
On adjoints and dual matroids
M. Alfter
,
W. Kern
,
A. Wanka
Journal of Combinatorial Theory Series B
50
, 1990, pp. 208-213
Intersection diagrams of distance-biregular graphs
Kazumasa Nomura
Journal of Combinatorial Theory Series B
50
, 1990, pp. 214-221
Perfectly contractile graphs
Marc E. Bertschi
Journal of Combinatorial Theory Series B
50
, 1990, pp. 222-230
A fast algorithm for coloring Meyniel graphs
A. Hertz
Journal of Combinatorial Theory Series B
50
, 1990, pp. 231-240
On the numbers of independent
k
-sets in a claw free graph
Yahya Ould Hamidoune
Journal of Combinatorial Theory Series B
50
, 1990, pp. 241-244
On circuit decomposition of planar Eulerian graphs
Herbert Fleischner
,
András Frank
Journal of Combinatorial Theory Series B
50
, 1990, pp. 245-253
Cycles and paths of many lengths in bipartite digraphs
Denise Amar
,
Yannis Manoussakis
Journal of Combinatorial Theory Series B
50
, 1990, pp. 254-264
The incidence structure of subspaces with well-scaled frames
Jon Lee
Journal of Combinatorial Theory Series B
50
, 1990, pp. 265-287
Digraphs with degree equivalent induced subdigraphs
Li Jionsheng
,
Huang Daode
,
Pan Qun
Journal of Combinatorial Theory Series B
50
, 1990, pp. 288-298
Seiten 1
2
3
>