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=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
Aart Blokhuis
,
Andries E. Brouwer
,
Çiçek Güven
Combinatorica
34
(1), 2003, pp. 1-10
Connectivity and tree structure in finite graphs
Johannes Carmesin
,
Reinhard Diestel
,
Fabian Hundertmark
,
Maya Stein
Combinatorica
34
(1), 2003, pp. 11-46
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
Yoshimi Egawa
,
Kenta Ozeki
Combinatorica
34
(1), 2003, pp. 47-60
Sparsely intersecting perfect matchings in cubic graphs
Edita Mác̑ajová
,
Martin S̑koviera
Combinatorica
34
(1), 2003, pp. 61-94
Approximating minimum-cost edge-covers of crossing biset-families
Zeev Nutov
Combinatorica
34
(1), 2003, pp. 95-114
Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order
2\mathcal P
Jin-Xin Zhou
,
Yan-Quan Feng
Combinatorica
34
(1), 2003, pp. 115-128
Connected Baranyai's theorem
M. Amin Bahmanian
Combinatorica
34
(2), 2003, pp. 129-138
Strong approximation in random towers of graphs
Yair Glasner
Combinatorica
34
(2), 2003, pp. 139-172
Constructing Ramsey graphs from Boolean function representations
Parikshit Gopalan
Combinatorica
34
(2), 2003, pp. 173-206
Topological minors in line graphs - A proof of Zha's conjecture
Roi Krakovski
Combinatorica
34
(2), 2003, pp. 207-252
Addendum to ``Commentary for ``On planarity of compact, locally connected, metric spaces''
R. Bruce Richter
,
Brendan Rooney
,
Carsten Thomassen
Combinatorica
34
(2), 2003, pp. 253-254
Steiner transitive-closure spanners of low-dimensional posets
Piotr Berman
,
Arnab Bhattacharyya
,
Elena Grigorescu
,
Sofya Raskhodnikova
,
David P. Woodruff
,
Grigory Yaroslavtsev
Combinatorica
34
(3), 2003, pp. 255-277
A minimum degree condition forcing complete graph immersion
Matt Devos
,
Zdenȇk Dvoȓák
,
Jacob Fox
,
Jessica McDonald
,
Bojan Mohar
,
Diego Scheide
Combinatorica
34
(3), 2003, pp. 279-298
Exact solution of the hypergraph Turán problem for
k
-uniform linear paths
Zoltán Füredi
,
Tao Jiang
,
Robert Seiver
Combinatorica
34
(3), 2003, pp. 299-322
Ore's conjecture for
k=4
and Grötzsch's theorem
Alexandr Kostochka
,
Matthew Yancey
Combinatorica
34
(3), 2003, pp. 323-329
Plünnecke and Kneser type theorems for dimension estimates
Cédric Lecouvey
Combinatorica
34
(3), 2003, pp. 331-358
On the minimal Fourier degree of symmetric Boolean functions
Amir Shpilka
,
Avishay Tal
Combinatorica
34
(3), 2003, pp. 359-377
Extremal results for odd cycles in sparse pseudorandom graphs
Elad Aigner-Horev
,
Hiệp Hàn
,
Mathias Schacht
Combinatorica
34
(4), 2003, pp. 379-406
Regular graphs of large girth and arbitrary degree
Xavier Dahan
Combinatorica
34
(4), 2003, pp. 407-426
Measurable events indexed by products of trees
Pandelis Dodos
,
Vassilis Kanellopoulos
,
Konstantinos Tyros
Combinatorica
34
(4), 2003, pp. 427-470
An upper bound on the number of high-dimensional permutations
Nathan Linial
,
Zur Luria
Combinatorica
34
(4), 2003, pp. 471-486
Coloring intersection graphs of
x
-monotone curves in the plane
Andrew Suk
Combinatorica
34
(4), 2003, pp. 487-505
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
József Balogh
,
János Barát
,
Dániel Gerbner
,
András Gyárfás
,
Gábor N. Sárközy
Combinatorica
34
(5), 2003, pp. 507-526
Triangulations of the sphere, bitrades and Abelian groups
Simon R. Blackburn
,
Thomas A. McCourt
Combinatorica
34
(5), 2003, pp. 527-546
The circumference of the square of a connected graph
Stephan Brandt
,
Janina Müttel
,
Dieter Rautenbach
Combinatorica
34
(5), 2003, pp. 547-559
Seiten 1
2
>