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=Combinatorica AND Volume=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ryser's conjecture for tripartite 3-graphs
Ron Aharoni
Combinatorica
21
(1), 2001, pp. 1-4
Edge-coloring bipartite multigraphs in
O(E \log D)
time
Richard Cole
,
Kirstin Ost
,
Stefan Schirra
Combinatorica
21
(1), 2001, pp. 5-12
Integer and fractional packings in dense graphs
P.E. Haxell
,
V. Rödl
Combinatorica
21
(1), 2001, pp. 13-38
A factor 2 approximation algorithm for the generalized Steiner network problem
Kamal Jain
Combinatorica
21
(1), 2001, pp. 39-60
Critical facets of the stable set polytope
László Lipták
,
László Lovász
Combinatorica
21
(1), 2001, pp. 61-88
The clique complex and hypergraph matching
Roy Meshulam
Combinatorica
21
(1), 2001, pp. 89-94
Deterministic routing with bounded buffers: Turning offline into online protocols
Friedhelm Meyer auf der Heide
,
Christian Scheideler
Combinatorica
21
(1), 2001, pp. 95-138
Tilings of the square with similar right triangles
Balázs Szegedy
Combinatorica
21
(1), 2001, pp. 139-144
Uncrossing a family of set-pairs
Tamás Fleiner
Combinatorica
21
(1), 2001, pp. 145-150
Ramsey-type theorems with forbidden subgraphs
Noga Alon
,
János Pach
,
József Solymosi
Combinatorica
21
(2), 2001, pp. 155-170
Vertex covers by edge disjoint cliques
Tom Bohman
,
Alan Frieze
,
Miklós Ruszinkó
,
Lubos Thoma
Combinatorica
21
(2), 2001, pp. 171-197
On bipartite graphs with linear Ramsey numbers
R.L. Graham
,
V. Rödl
,
A. Ruciński
Combinatorica
21
(2), 2001, pp. 199-209
Chromatic numbers of Cayley graphs on
Z
and recurrence
Y. Katzelson
Combinatorica
21
(2), 2001, pp. 211-219
Convex sets in the plane with three of every four meeting
Daniel J. Kleitman
,
András Gyárfás
,
Géza Tóth
Combinatorica
21
(2), 2001, pp. 221-232
Some remarks on obligatory subsystems of uncountably chromatic triple systems
Péter Komjáth
Combinatorica
21
(2), 2001, pp. 233-238
Tauberian theorem of Erd\Hos revisited
J. Korevaar
Combinatorica
21
(2), 2001, pp. 239-250
Subdivisons of a graph of maximal degree
n+1
in graphs of average degree
n+\epsilon
and large girth
W. Mader
Combinatorica
21
(2), 2001, pp. 251-265
The Erd\Hos-Pósa property for odd cycles in highly connected graphs
Dieter Rautenbach
,
Bruce Reed
Combinatorica
21
(2), 2001, pp. 267-278
Additive completion of lacunary sequences
Imre Z. Ruzsa
Combinatorica
21
(2), 2001, pp. 279-291
Another look at the Erd\Hos-Hajnal-Pósa results on partitioning edges of the Rado graph
Norbert Sauer
Combinatorica
21
(2), 2001, pp. 293-308
Consistently there is no non trivial CCC forcing notion with the Sacks or Laver property
Saharon Shelah
Combinatorica
21
(2), 2001, pp. 309-319
The Erd/Hos-Pósa property for odd cycles in graphs of large connectivity
Carsten Thomassen
Combinatorica
21
(2), 2001, pp. 321-333
On a generalized anti-Ramsey problem
Maria Axenovich
,
André Kündgen
Combinatorica
21
(3), 2001, pp. 335-349
On a max-min problem concerning weights of edges
Stanislav Jendrol
,
Ingo Schiermeyer
Combinatorica
21
(3), 2001, pp. 351-359
Optimal edge-colourings for a class of planar multigraphs
Odile Marcotte
Combinatorica
21
(3), 2001, pp. 361-394
Seiten 1
2
>