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
[1]
Hilfe
Suche: Journal=Combinatorica AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A strongly non-Ramsey order type
A. Hajnal
,
P. Komjáth
Combinatorica
17
(3), 1997, pp. 363-367
On the stochastic independence properties of hard-core distributions
Jeff Kahn
,
P. Mark Kayll
Combinatorica
17
(3), 1997, pp. 369-391
Covering odd cycles
János Komlós
Combinatorica
17
(3), 1997, pp. 393-400
On the minimal number of edges in color-critical graphs
Michael Krivelevich
Combinatorica
17
(3), 1997, pp. 401-426
Graphs drawn with few crossings per edge
János Pach
,
Géza Tóth
Combinatorica
17
(3), 1997, pp. 427-439
On simultaneous edge-face colorings of plane graphs
Daniel P. Sanders
,
Yue Zhao
Combinatorica
17
(3), 1997, pp. 441-445
On linear combinatorics I. Concurrency - An algebraic approach
György Elekes
Combinatorica
17
(4), 1997, pp. 447-458
A variant of the classical Ramsey problem
Paul Erdŏs
,
András Gyárfás
Combinatorica
17
(4), 1997, pp. 459-467
Colouring a graph frugally
Hugh Hind
,
Michael Molloy
,
Bruce Reed
Combinatorica
17
(4), 1997, pp. 469-482
The Colin de Verdière number and sphere representations of a graph
Andrew Kotlov
,
László Lovász
,
Santosh Vempala
Combinatorica
17
(4), 1997, pp. 483-521
Finite group actions and asymptotic expansion of
e^{P(z)}
Thomas Müller
Combinatorica
17
(4), 1997, pp. 523-554
Expanding graphs and invariant means
Yehuda Shalom
Combinatorica
17
(4), 1997, pp. 555-575
Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
Miklós Simonovits
,
Vera T. Sós
Combinatorica
17
(4), 1997, pp. 577-596
Seiten
<
1
2