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.
Existence of polyhedral embeddings of graphs
Bojan Mohar
Combinatorica
21
(3), 2001, pp. 395-401
Size Ramsey numbers of Stars versus 3-chromatic graphs
Oleg Pikhurko
Combinatorica
21
(3), 2001, pp. 403-412
Groups covered by an infinite number of Abelian subgroups
Károly Podoski
Combinatorica
21
(3), 2001, pp. 413-416
Totally odd
K_4
-subdivisions in 4-chromatic graphs
Carsten Thomassen
Combinatorica
21
(3), 2001, pp. 417-443
The size of 3-cross-free families
Tamás Fleiner
Combinatorica
21
(3), 2001, pp. 445-448
On a degree property of cross-intersecting families
Gohar M. Kyureghyan
Combinatorica
21
(3), 2001, pp. 449-453
The cost of the missing bit: Communication complexity with help
László Babai
,
Thomas P. Hayes
,
Peter G. Kimmel
Combinatorica
21
(4), 2001, pp. 455-488
Mixed and isoperimetric estimates on the log-Sobolev constants of graphs and Markov chains
Christian Houdré
Combinatorica
21
(4), 2001, pp. 489-513
Density conditions for panchromatic colourings of hypergraphs
Alexandr V. Kostochka
,
Douglas R. Woodall
Combinatorica
21
(4), 2001, pp. 515-541
On the sparsity order of a graph and its deficiency in chordality
Monique Laurent
Combinatorica
21
(4), 2001, pp. 543-570
Linear
k
-blocking sets
Guglielmo Lunardon
Combinatorica
21
(4), 2001, pp. 571-581
Cayley snarks and almost simple groups
Roman Nedela
,
Martin S̑koviera
Combinatorica
21
(4), 2001, pp. 583-590
An upper bound for
d
-dimensional difference sets
Yonutz V. Stanchescu
Combinatorica
21
(4), 2001, pp. 591-595
Seiten
<
1
2