Follow
Jeno Lehel
Jeno Lehel
Emeritus Professor, University of Memphis, Tennessee
Verified email at louisville.edu
Title
Cited by
Cited by
Year
Irregular networks
G Chartrand, MS Jacobson, J Lehel, OR Oellermann, S Ruiz, F Saba
Congr. Numer 64 (197-210), 250th, 1988
4841988
On‐line and first fit colorings of graphs
A Gyárfás, J Lehel
Journal of Graph theory 12 (2), 217-227, 1988
2781988
Adjacent vertex distinguishing edge-colorings
PN Balister, E Gyori, J Lehel, RH Schelp
SIAM Journal on Discrete Mathematics 21 (1), 237-250, 2007
2382007
Graphs realizing the same degree sequences and their respective clique numbers
P Erdos, MS Jacobson, J Lehel
Graph Theory, Combinatorics and Application 1, 439-449, 1991
1301991
Potentially G-grafical degree sequences
RJ Gould, MS Jacobson, J Lehel
Combinatorics, graph theory, and algorithms. Vol. 2., 451-460, 1999
1171999
Covering and coloring problems for relatives of intervals
A Gyárfás, J Lehel
Discrete Mathematics 55 (2), 167-180, 1985
1111985
Irregular networks, regular graphs and integer matrices with distinct row and column sums
RJ Faudree, RH Schelp, MS Jacobson, J Lehel
Discrete Mathematics 76 (3), 223-240, 1989
1021989
Facts and quests on degree irregular assignments
J Lehel
Graph Theory, Combinatorics and Applications, Willey, New York 91, 765-782, 1991
921991
A Helly-type problem in trees
A Gyárfás, J Lehel
Combinatorial Theory and its applications 4, 571-584, 1970
921970
Packing trees of different order into Kn
A Gyárfás, J Lehel
Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) 1, 463-469, 1978
901978
Toughness, hamiltonicity and split graphs
D Kratsch, J Lehel, H Müller
Discrete Mathematics 150 (1), 231-246, 1996
841996
A Ramsey-type problem in directed and bipartite graphs
A Gyárfás, J Lehel
Periodica Mathematica Hungarica 3 (3-4), 299-304, 1973
831973
Bound on the irregularity strength of regular graphs
RJ Faudree, J Lehel
Colloq. Math. Soc. János Bolyai 52, 247-256, 1987
821987
Ramsey numbers for local colorings
A Gyárfás, J Lehel, RH Schelp, Z Tuza
Graphs and Combinatorics 3, 267-277, 1987
651987
Neighborhood perfect graphs
J Lehel, Z Tuza
Discrete Mathematics 61 (1), 93-101, 1986
631986
Connected graphs without long paths
PN Balister, E Győri, J Lehel, RH Schelp
Discrete Mathematics 308 (19), 4487-4494, 2008
572008
1ST FIT AND ONLINE CHROMATIC NUMBER OF FAMILIES OF GRAPHS
A Gyárfás, J Lehel
Ars Combinatoria 29, 168-176, 1990
511990
Tough enough chordal graphs are hamiltonian
G Chen, MS Jacobson, AE Kézdy, J Lehel
Networks: An International Journal 31 (1), 29-38, 1998
501998
Local k-colorings of graphs and hypergraphs
A Gyárfás, J Lehel, J Nešetřil, V Rödl, RH Schelp, Z Tuza
Journal of Combinatorial Theory, Series B 43 (2), 127-139, 1987
481987
A characterization of totally balanced hypergraphs
J Lehel
Discrete mathematics 57 (1-2), 59-65, 1985
481985
The system can't perform the operation now. Try again later.
Articles 1–20