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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
String graphs requiring exponential representations
Jan Kratochvíl
,
Jiȓí Matous̑ek
Journal of Combinatorial Theory Series B
53
, 1991, pp. 1-4
Efficient characterizations of
n
-chromatic absolute retracts
Hans-Jürgen Bandelt
,
Erwin Pesch
Journal of Combinatorial Theory Series B
53
, 1991, pp. 5-31
Short proofs on multicommodity flows and cuts
A. Schrijver
Journal of Combinatorial Theory Series B
53
, 1991, pp. 32-39
Clumps, minimal asymmetric graphs, and involutions
Gert Sabidussi
Journal of Combinatorial Theory Series B
53
, 1991, pp. 40-79
A characterisation of graphs having three pairwise compatible Euler tours
Bill Jackson
Journal of Combinatorial Theory Series B
53
, 1991, pp. 80-92
Supplementary Eulerian vectors in isotropic systems
Bill Jackson
Journal of Combinatorial Theory Series B
53
, 1991, pp. 93-105
On the two-dimensional generic rigidity matroid and its dual
Brigitte Servatius
Journal of Combinatorial Theory Series B
53
, 1991, pp. 106-113
Symmetric
Y
-graphs and
H
-graphs
J.D. Horton
,
I.Z. Bouwer
Journal of Combinatorial Theory Series B
53
, 1991, pp. 114-129
The number of rooted 2-connected triangular maps on the projective plane
Zhi-Cheng Gao
Journal of Combinatorial Theory Series B
53
, 1991, pp. 130-142
Multicolored forests in bipartite decompositions of graphs
Noga Alon
,
Richard A. Brualdi
,
Bryan L. Shader
Journal of Combinatorial Theory Series B
53
, 1991, pp. 143-148
A weighted min-max relation for intervals
Anna Lubiw
Journal of Combinatorial Theory Series B
53
, 1991, pp. 151-172
Hamiltonicity in claw-free graphs
F. Bruce Shepherd
Journal of Combinatorial Theory Series B
53
, 1991, pp. 173-194
Multiply-intersecting families
P. Frankl
Journal of Combinatorial Theory Series B
53
, 1991, pp. 195-234
On a composition of independence systems by circuit identification
R. Euler
,
A.R. Mahjoub
Journal of Combinatorial Theory Series B
53
, 1991, pp. 235-259
Ecken von kleinem Grad in kritisch
n
-fach zusammenhängenden Digraphen
W. Mader
Journal of Combinatorial Theory Series B
53
, 1991, pp. 260-272
Two classes of perfect graphs
Liping Sun
Journal of Combinatorial Theory Series B
53
, 1991, pp. 273-292
The number of rooted maps on an orientable surface
Edward A. Bender
,
E. Rodney Canfield
Journal of Combinatorial Theory Series B
53
, 1991, pp. 293-299
A note on the independence number of triangle-free graphs, II
James B. Shearer
Journal of Combinatorial Theory Series B
53
, 1991, pp. 300-307
The Hamiltonian property of generalized de Bruijn digraphs
D.Z. Du
,
D.F. Hsu
,
F.K. Hwang
,
X.M. Zhang
Journal of Combinatorial Theory Series B
52
, 1991, pp. 1-8
The total chromatic number of nearly complete bipartite graphs
A.J.W. Hilton
Journal of Combinatorial Theory Series B
52
, 1991, pp. 9-19
Cycles and paths through specified vertices in
k
-connected graphs
Y. Egawa
,
R. Glas
,
S.C. Locke
Journal of Combinatorial Theory Series B
52
, 1991, pp. 20-29
Infinite friendship graphs with infinite parameters
Gen̆a Hahn
,
Eric C. Milner
,
Robert E. Woodrow
Journal of Combinatorial Theory Series B
52
, 1991, pp. 30-41
On a generalization of a theorem of Nash-Williams
Bert Fassbender
Journal of Combinatorial Theory Series B
52
, 1991, pp. 42-44
A Ramsey type problem concerning vertex colourings
Jason I. Brown
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
52
, 1991, pp. 45-52
String graphs. I. The number of critical nonstring graphs is infinite
Jan Kratochvíl
Journal of Combinatorial Theory Series B
52
, 1991, pp. 53-66
Seiten 1
2
3
>