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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
String graphs. II. Recognizing string graphs is NP-hard
Jan Kratochvíl
Journal of Combinatorial Theory Series B
52
, 1991, pp. 67-78
Hypergraph coverings and local colorings
Yair Caro
,
Zsolt Tuza
Journal of Combinatorial Theory Series B
52
, 1991, pp. 79-85
The Menger-like property of the tree-width of infinite graphs
Igor Kȓiz̑
,
Robin Thomas
Journal of Combinatorial Theory Series B
52
, 1991, pp. 86-91
Extensions of Gallai's graph covering theorems for uniform hypergraphs
Zsolt Tuza
Journal of Combinatorial Theory Series B
52
, 1991, pp. 92-96
An interpolation theorem for partitions which are indivisible with respect to cohereditary properties
J. Ivanc̑o
Journal of Combinatorial Theory Series B
52
, 1991, pp. 97-101
On graphs with exactly one eigenvalue less than -1
Miroslav Petrović
Journal of Combinatorial Theory Series B
52
, 1991, pp. 102-112
Extremal graphs with no
C^4
's,
C^6
's, or
C^{10}
's
R. Wenger
Journal of Combinatorial Theory Series B
52
, 1991, pp. 113-116
A new proof of the theorem by Fleischner
Stanislav Ȓiha
Journal of Combinatorial Theory Series B
52
, 1991, pp. 117-123
Characterization of the maximum genus of a signed graph
Jozef S̑irán̑
,
Martin S̑koviera
Journal of Combinatorial Theory Series B
52
, 1991, pp. 124-146
On the thickness and arboricity of a graph
Alice M. Dean
,
Joan P. Hutchinson
,
Edward R. Scheinerman
Journal of Combinatorial Theory Series B
52
, 1991, pp. 147-151
Graph minors. X. Obstructions to tree-decomposition
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
52
, 1991, pp. 153-190
Permutation-partition pairs. III. Embedding distributions of linear families of graphs
Saul Stahl
Journal of Combinatorial Theory Series B
52
, 1991, pp. 191-218
An upper bound for the average number of regions
Saul Stahl
Journal of Combinatorial Theory Series B
52
, 1991, pp. 219-221
Properties of graphs with polynomial growth
Norbert Seifter
Journal of Combinatorial Theory Series B
52
, 1991, pp. 222-235
The number of rooted triangular maps on a surface
Zhi-Cheng Gao
Journal of Combinatorial Theory Series B
52
, 1991, pp. 236-249
Constructing self-dual codes using graphs
Haluk Oral
Journal of Combinatorial Theory Series B
52
, 1991, pp. 250-258
Even subgraph expansions for the flow polynomial of cubic plane maps
François Jaeger
Journal of Combinatorial Theory Series B
52
, 1991, pp. 259-273
Quickly excluding a forest
Dan Bienstock
,
Neil Robertson
,
Paul Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
52
, 1991, pp. 274-283
Seiten 1
2
>