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=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A class of matchings and a related lattice
K. Kilakos
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 1-10
Excluding a long double path minor
Guoli Ding
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 11-23
Directed cycles with two chords and strong spanning directed subgraphs with few arcs
Carsten Thomassen
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 24-33
Bipartite distance-regular graphs with an eigenvalue of multiplicity
k
Norio Yamazaki
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 34-37
Proof of a conjecutre of Bollobás on nested cycles
Guantao Chen
,
Paul Erdös
,
William Staton
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 38-43
The maximum number of triangles in arrangements of pseudolines
Jean-Pierre Roudneff
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 44-74
Hamiltonian decompositions of Cayley graphs on Abelian groups of odd order
Jiuqiang Liu
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 75-86
Polyhedra of small order and their Hamiltonian properties
Michael B. Dillencourt
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 87-122
Supereulerian graphs and the Petersen Graph
Paul A. Catlin
,
Hong-Jian Lai
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 123-139
A complete solution of a problem of Bondy concerning multipartite tournaments
Yubao Guo
,
Lutz Volkmann
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 140-145
Note on the colored Tverberg theorem
Jiȓí Matous̑ek
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 146-151
Covering the edges of a connected graph by paths
L. Pyber
Journal of Combinatorial Theory Series B
66
(1), 1996, pp. 152-159
Dichromatic sums revisited
W.T. Tutte
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 161-167
Vertex-disjoint cycles of the same length
Yoshimi Egawa
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 168-200
Separating and nonseparating disjoint homotopic cycles in graph embeddings
Richard Brunet
,
Bojan Mohar
,
R. Bruce Richter
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 201-231
Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
Lars Dovling Andersen
,
André Bouchet
,
Bill Jackson
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 232-246
Recognizing
P_3
-structure: A switching approach
Ryan B. Hayward
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 247-262
Matching covered graphs and subdivisions of
K_4
and
\overline{C_6}
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 263-268
H
-factors in dense graphs
Noga Alon
,
Raphael Yuster
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 269-282
A proof of a conjecture of Bondy concerning paths in weighted digraphs
B. Bollobás
,
A.D. Scott
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 283-292
Well-covered claw-free graphs
David Tankus
,
Michael Tarsi
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 293-302
Accessibility and ends of graphs
Rögnvaldur G. Möller
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 303-309
Entropy splitting hypergraphs
Gábor Simonyi
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 310-323
On induced Ramsey numbers for graphs with bounded maximum degree
Tomasz Łuczak
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 324-333
Unavoidable minors of large 3-connected binary matroids
Guoli Ding
,
Bogdan Oporowski
,
James Oxley
,
Dirk Vertigan
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 334-360
Seiten 1
2
>