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: Author="Erd{\H{o}}s, Paul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding large
p
-colored diameter two subgraphs
Paul Erdŏs
,
Tom Fowler
Graphs and Combinatorics
15
(1), 1999, pp. 21-27
How to decrease the diameter of triangle-free graphs
Paul Erdŏs
,
András Gyárfás
,
Miklós Ruszinkó
Combinatorica
18
(4), 1998, pp. 493-501
A class of edge critical 4-chromatic graphs
Guantao Chen
,
Paul Erdŏs
,
András Gyárfas
,
R.H. Schelp
Graphs and Combinatorics
13
, 1997, pp. 139-146
A variant of the classical Ramsey problem
Paul Erdŏs
,
András Gyárfás
Combinatorica
17
(4), 1997, pp. 459-467
On
k
-saturated graphs with restrictions on the degrees
Noga Alon
,
Paul Erdŏs
,
Ron Holzman
,
Michael Krivelevich
Journal of Graph Theory
23
(1), 1996, pp. 1-20
On maximal triangle-free graphs
Paul Erdŏs
,
Ron Holzman
Journal of Graph Theory
18
(6), 1994, pp. 585-594
Clique coverings of the edges of a random graph
Béla Bollobás
,
Paul Erdŏs
,
Joel Spencer
,
Douglas B. West
Combinatorica
13
(1), 1993, pp. 1-5
Monochromatic infinite paths
Paul Erdŏs
,
Fred Galvin
Discrete Mathematics
113
(1-3), 1993, pp. 59-70
Some problems and results in cochromatic theory
Paul Erdŏs
,
John Gimbel
Quo vadis, graph theory? A source book for challenges and directions
Annals of Discrete Mathematics 55
, 1993, pp. 261-264
Rainbow subgraphs in edge-colorings of complete graphs
Paul Erdŏs
,
Zsolt Tuza
Quo vadis, graph theory? A source book for challenges and directions
Annals of Discrete Mathematics 55
, 1993, pp. 81-88
Diverse homogeneous sets
Andreas Blass
,
Paul Erdŏs
,
Alan Taylor
Journal of Combinatorial Theory Series A
59
(2), 1992, pp. 312-317
Bounds for arrays of dots with distinct slopes or lengths
Paul Erdŏs
,
Ron Graham
,
Imre Z. Ruzsa
,
Herbert Taylor
Combinatorica
12
, 1992, pp. 39-44
Midpoints of diagonals of convex
n
-gons
Paul Erdŏs
,
Peter Fishburn
,
Zoltan Füredi
SIAM Journal on Discrete Mathematics
4
(3), 1991, August, pp. 329-341
Some extremal results in cochromatic and dichromatic theory
Paul Erdŏs
,
John Gimbel
,
Dieter Kratsch
Journal of Graph Theory
15
(6), 1991, pp. 579-585
Lopsided Lovász local lemma and Latin transversals
Paul Erdŏs
,
Joel Spencer
Discrete Applied Mathematics
30
, 1991, pp. 151-154
Representations of graphs and orthogonal Latin square graphs
Paul Erdŏs
,
Anthony B. Evans
Journal of Graph Theory
13
(5), 1989, pp. 593-595
Radius, diameter, and minimum degree
Paul Erdŏs
,
János Pach
,
Richard Pollack
,
Zsolt Tuza
Journal of Combinatorial Theory Series B
47
, 1989, pp. 73-79
Monochromatic sumsets
Paul Erdŏs
,
Joel Spencer
Journal of Combinatorial Theory Series A
50
, 1989, pp. 162-163
Tight bounds on the chromatic sum of a connected graph
Carsten Thomassen
,
Paul Erdŏs
,
Yousef Alavi
,
Paresh J. Malde
,
Allen J. Schwenk
Journal of Graph Theory
13
(3), 1989, pp. 353-357
Repeated distances in space
David Avis
,
Paul Erdŏs
,
János Pach
Graphs and Combinatorics
4
, 1988, pp. 207-217
Graphs with unavoidable subgraphs with large degrees
L. Caccetta
,
Paul Erdŏs
,
K. Vijayan
Journal of Graph Theory
12
(1), 1988, pp. 17-27
How to make a graph bipartite
Paul Erdŏs
,
Ralph Faudree
,
János Pach
,
Joel Spencer
Journal of Combinatorial Theory Series B
45
, 1988, pp. 86-98
Cutting a graph into two dissimilar halves
Paul Erdŏs
,
Mark Goldberg
,
János Pach
,
Joel Spencer
Journal of Graph Theory
12
(1), 1988, pp. 121-131
Some old and new problems in combinatorial geometry
Paul Erdŏs
Applications of Discrete Mathematics - Proceedings of the 3rd Conference on Discrete Mathematics (Clemson, South Carolina, May 14-16, 1986), 1988, pp. 32-37
Highly irregular graphs
Yousef Alavi
,
Gary Chartrand
,
F.R.K. Chung
,
Paul Erdŏs
,
R.L. Graham
,
Ortrud R. Oellermann
Journal of Graph Theory
11
(2), 1987, pp. 235-249
Seiten 1
2
>