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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Random graph coverings I: General theory and graph connectivity
Alon Amit
,
Nathan Linial
Combinatorica
22
(1), 2002, pp. 1-18
Perfect graphs, partitionable graphs and cutsets
Michele Conforti
,
Gérard Cornuéjols
,
Grigor Gasparyan
,
Kristina Vus̑ković
Combinatorica
22
(1), 2002, pp. 19-33
Homomorphisms of products of graphs into graphs without four cycles
Christian Delhommé
,
Norbert Sauer
Combinatorica
22
(1), 2002, pp. 35-46
Graph orientations with edge-connection and parity constraints
András Frank
,
Zoltán Király
Combinatorica
22
(1), 2002, pp. 47-70
Connected
[a,b]
-factors in graphs
Mekkia Kouider
,
Maryvonne Mahéo
Combinatorica
22
(1), 2002, pp. 71-82
On the knowledge complexity of
NP
Erez Petrank
,
Gábor Tardos
Combinatorica
22
(1), 2002, pp. 83-121
Almost optimal dispersers
Amnon Ta-Shma
Combinatorica
22
(1), 2002, pp. 123-145
Hamiltonian Kneser graphs
Ya-Chen Chen
,
Z. Füredi
Combinatorica
22
(1), 2002, pp. 147-149
A double bounded version of Schur's partition theorem
Krishnaswami Alladi
,
Alexander Berkovich
Combinatorica
22
(2), 2002, pp. 151-168
Positional games and the second moment method
József Beck
Combinatorica
22
(2), 2002, pp. 169-216
Sparse quasi-random graphs
Fan Chung
,
Ronald Graham
Combinatorica
22
(2), 2002, pp. 217-244
Combinatorial and arithmetical properties of linear numeration systems
Peter J. Grabner
,
Peter Kirschenhofer
,
Robert F. Tichy
Combinatorica
22
(2), 2002, pp. 245-267
Large cliques in
C_4
-free graphs
András Gyárfás
,
Alice Hubenko
,
József Solymosi
Combinatorica
22
(2), 2002, pp. 269-274
Transversals in uniform hypergraphs with property
(p,2)
Alexandr V. Kostochka
Combinatorica
22
(2), 2002, pp. 275-285
Ramsey numbers for trees of small maximum degree
P.E. Haxell
,
T. Łuczak
,
P.W. Tingley
Combinatorica
22
(2), 2002, pp. 287-320
Cycles of nonzero elements in low rank matrices
Pavel Pudlák
Combinatorica
22
(2), 2002, pp. 321-334
A tree version of König's theorem
Ron Aharoni
,
Eli Berger
,
Ran Ziv
Combinatorica
22
(3), 2002, pp. 335-343
Small universal graphs for bounded-degree planar graphs
Michael Capalbo
Combinatorica
22
(3), 2002, pp. 345-359
Improved bounds for acyclic job shop scheduling
Uriel Feige
,
Christian Scheideler
Combinatorica
22
(3), 2002, pp. 361-399
Diophantine approximations and integer points of cones
Martin Henk
,
Robert Weismantel
Combinatorica
22
(3), 2002, pp. 401-407
Perfect matchings in balanced hypergraphs - A combinatorial approach
Andreas Huck
,
Eberhard Triesch
Combinatorica
22
(3), 2002, pp. 409-416
Improved pseudorandom generators for combinatorial rectangles
Chi-Jen Lu
Combinatorica
22
(3), 2002, pp. 417-434
Highly arc-transitive digraphs with no homomorphism onto
Z
Aleksander Malinic̑
,
Dragen Marus̑ic̑
,
Norbert Seifter
,
Boris Zgrablić
Combinatorica
22
(3), 2002, pp. 435-443
An anti-Ramsey theorem
J.J. Montellano-Ballesteros
,
V. Neumann-Lara
Combinatorica
22
(3), 2002, pp. 445-449
On Erd\Hos's conjecture on multiplicities of complete subgraphs lower upper bound for cliques of size 6
Frantisek Franek
Combinatorica
22
(3), 2002, pp. 451-454
Seiten 1
2
>