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: Series=B AND YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamilton cycle decomposition of line graphs and a conjecture of Bermond
A. Muthusamy
,
P. Paulraja
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 1-16
Extremal graphs for intersecting trinagles
P. Erdös
,
Z. Füredi
,
R.J. Gould
,
D.S. Gunderson
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 89-100
3-list-coloring planar graphs of girth 5
Carsten Thomassen
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 101-107
Linear sets with five distinct differences among any four elements
András Gyárfás
,
Jenö Lehel
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 108-118
Five cycle double covers of some cubic graphs
Andreas Huck
,
Martin Kochol
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 119-125
Kuratowski chains
Neil Robertson
,
Paul Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 127-154
Petersen family minors
Neil Robertson
,
Paul Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 155-184
Sachs' linkless embedding conjecture
Neil Robertson
,
Paul Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 185-227
Graphs of prescribed girth and bi-degree
Z. Füredi
,
F. Lazebnik
,
Á. Seress
,
V.A. Ustimenko
,
A.J. Woldar
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 228-239
An extremal result for subgraphs with few edges
Stephan Brandt
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 288-299
Spin models on bipartite distance-regular graphs
K. Nomura
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 300-313
A note on graphical partitions
C.C. Rousseau
,
Firasath Ali
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 314-318
Almost all maps are asymmetric
L.B. Richmond
,
N.C. Wormland
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 1-7
On the optimal vertex-connectivity augmentation
Tibor Jordán
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 8-20
On infinite antichains of matroids
Guoli Ding
,
Bogdan Oporowski
,
James Oxley
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 21-40
Dense graphs without 3-regular subgraphs
László Pyber
,
Vojtech Rödl
,
Endre Szemerédi
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 41-54
The square of paths and cycles
Genghua Fan
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 55-64
Graph minors: XIII. The disjoint paths problem
Neil Robertson
,
P.D.Seymour
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 65-110
Graph decompositions without isolated vertices
Hikoe Enomoto
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 111-124
Universal graphs without large cliques
P. Komjáth
,
S. Shelah
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 125-135
The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 136-145
Sparse anti-Ramsey graphs
Yoshiharu Kohayakawa
,
Tomasz Łuczak
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 146-152
The list chromatic index of a bipartite multigraph
Fred Galvin
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 153-158
On locally Hoffman-Singleton graphs
John van Bon
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 159-161
Long cycles and 3-connected spanning subgraphs of bounded degree in 3-connected
K_{1,d}
-free graphs
Bill Jackson
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
63
(2), 1995, pp. 163-169
Seiten 1
2
>