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=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On canonical Ramsey numbers for complete graphs versus paths
Hanno Lefmann
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 1-13
A correlation inequality involving stable set and chromatic polynomials
Graham E. Farr
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 14-21
Graph searching and a min-max theorem for tree-width
P.D. Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 22-33
The girth of a directed distance-regular graph
Douglas A. Leonard
,
Kazumasa Nomura
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 34-39
Disjoint cycles in directed graphs on the torus and the Klein bottle
Guoli Ding
,
A. Schrijver
,
P.D. Seymour
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 40-45
Imprimitive representations of
SL(2,2^k)
Dragan Marus̑ic̑
,
Raffaele Scapellato
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 46-57
Generating linear extensions by adjacent transpositions
Douglas B. West
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 58-64
Tait's flyping conjecture for well-connected links
Alexander Schrijver
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 65-146
Graphs on the torus and geometry of numbers
Alexander Schrijver
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 147-158
Automorphism groups of higher-weight Dowling geometries
Joseph E. Bonin
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 161-173
General antifactors of graphs
András Sebŏ
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 174-184
The Ramsey number of an
N
-edge graph versus triangle is at most
2N+1
A.F. Sidorenko
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 185-196
A classification of symmetric graphs of order
3p
Ru-Ji Wang
,
Ming-Yao Xu
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 197-216
Minimal graphs with crossing number at least
k
R. Bruce Richter
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 217-224
The number of vertices of degree
k
in a minimally
k
-edge-connected graph
Mao-Cheng Cai
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 225-239
The coefficients of the Tutte polynomial are not unimodal
Werner Schwärzler
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 240-242
Some inequalities in distance-regular graphs
K. Nomura
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 243-247
Vertex-transitive graphs and accessibility
Carsten Thomassen
,
Wolfgang Woess
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 248-268
Fragments in 2-critically
n
-connected graphs
Jianji Su
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 269-279
On the Nash-Williams' lemma in graph reconstruction theory
B.D. Thatte
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 280-290
Monochromatic trees with respect to edge partitions
Vojtȇch Rödl
,
Bernd Voigt
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 291-298
Symmetric graphs of order a product of two distinct primes
Cheryl E. Praeger
,
Ru-Ji Wang
,
Ming-Yao Xu
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 299-318
On cycles in multipartite tournaments
G. Gutin
Journal of Combinatorial Theory Series B
58
(2), 1993, pp. 319-321