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: Author="Lehel, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Adjacent vertex distinguishing edge-colorings
P.N. Balister
,
E. Györi
,
J. Lehel
,
R.H. Schelp
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 237-250
Ramsey unsaturated and saturated graphs
P. Balister
,
J. Lehel
,
R.H. Schelp
Journal of Graph Theory
51
(1), 2006, pp. 22-32
\Phi
-treshold and
\Phi
-tolerance chain graphs
M.S. Jacobson
,
J. Lehel
,
L.M. Lesniak
Discrete Applied Mathematics
44
(1-3), 1993, pp. 191-203
On-line and first fit colorings of graphs
A. Gyárfás
,
J. Lehel
Journal of Graph Theory
12
(2), 1988, pp. 217-227
Local
k
-colorings of graphs and hypergraphs
A. Gyárfás
,
J. Lehel
,
J. Nes̑etȓil
,
V. Rödl
,
R.H. Schelp
,
Zs. Tuza
Journal of Combinatorial Theory Series B
43
, 1987, pp. 127-139
Ramsey numbers for local colorings
A. Gyárfás
,
J. Lehel
,
R.H. Schelp
,
ZS. Tuza
Graphs and Combinatorics
3
, 1987, pp. 267-277
Hypergraph families with bounded edge cover or transversal number
A. Gyárfás
,
J. Lehel
Combinatorica
3
, 1983, pp. 351-358
Upper bound on the order of
\tau
-critical hypergraphs
A. Gyárfás
,
J. Lehel
,
Zs. Tuza
Journal of Combinatorial Theory Series B
33
(2), 1982, October, pp. 161-165
Covers in hypergraphs
J. Lehel
Combinatorica
2
, 1982, pp. 305-309
Deltahedra are realizable as simplicial convex polyhedra
J. Lehel
Discrete Applied Mathematics
2
, 1980, pp. 81-84