Jeno Lehel 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	3664	968
h 指数	28	15
i10 指数	69	21

200

100

150

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 3 21 22 21 31 31 30 34 29 41 37 49 48 44 33 24 46 57 53 68 107 114 132 127 148 98 145 119 149 172 153 187 186 172 167 188 175 160 106

开放获取的出版物数量

查看全部

6 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Andras GyarfasAlfred renyi institute of Mathematics, Hungarian Academy of Sciences在 renyi.mta.hu 的电子邮件经过验证
Michael S. JacobsonUniversity of Colorado Denver在 ucdenver.edu 的电子邮件经过验证
Ralph FaudreeProvost, University of Memphis在 memphis.edu 的电子邮件经过验证
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, Veszprém在 dcs.uni-pannon.hu 的电子邮件经过验证
Paul ErdősMathematics
Guantao ChenGeorgia State University,在 gsu.edu 的电子邮件经过验证
Dieter Kratschprofesseur d'informatique, Universite de Lorraine在 univ-lorraine.fr 的电子邮件经过验证
Zoltán KirályELTE Eötvös Loránd University在 cs.elte.hu 的电子邮件经过验证
Gabor SarkozyWorcester Polytechnic Institute在 cs.wpi.edu 的电子邮件经过验证
Alex ScottProfessor of Mathematics, University of Oxford在 maths.ox.ac.uk 的电子邮件经过验证
Jaroslav NešetřilCharles University在 kam.mff.cuni.cz 的电子邮件经过验证
Noga AlonPrinceton University and Tel Aviv University在 tau.ac.il 的电子邮件经过验证
Imre BaranyProfessor of Mathematics, Renyi Institute, Hungary在 renyi.hu 的电子邮件经过验证
F. R. McMorrisIllinois Institute of Technology and University of Louisville在 iit.edu 的电子邮件经过验证
Ágnes TóthBudapest University of Technology and Economics在 cs.bme.hu 的电子邮件经过验证
Edward ScheinermanJohns Hopkins在 jhu.edu 的电子邮件经过验证
Zoltan Furedi在 illinois.edu 的电子邮件经过验证
Janos BaratAssociate Professor, University of Pannonia在 mik.uni-pannon.hu 的电子邮件经过验证
Tamas SzonyiDept Computer Science, Eotvos University在 cs.elte.hu 的电子邮件经过验证

关注

Jeno Lehel

Emeritus Professor, University of Memphis, Tennessee

在 louisville.edu 的电子邮件经过验证

Graph and Hypergraph Theory Combinatorics


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Irregular networks G Chartrand, MS Jacobson, J Lehel, OR Oellermann, S Ruiz, F Saba Congr. Numer 64 (197-210), 250th, 1988	505	1988
On‐line and first fit colorings of graphs A Gyárfás, J Lehel Journal of Graph theory 12 (2), 217-227, 1988	285	1988
Adjacent vertex distinguishing edge-colorings PN Balister, E Gyori, J Lehel, RH Schelp SIAM Journal on Discrete Mathematics 21 (1), 237-250, 2007	240	2007
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	131	1991
Potentially G-grafical degree sequences RJ Gould, MS Jacobson, J Lehel Combinatorics, graph theory, and algorithms. Vol. 2., 451-460, 1999	117	1999
Covering and coloring problems for relatives of intervals A Gyárfás, J Lehel Discrete Mathematics 55 (2), 167-180, 1985	110	1985
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	105	1989
Packing trees of different order into Kn A Gyárfás, J Lehel Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) 1, 463-469, 1978	96	1978
Facts and quests on degree irregular assignments J Lehel Graph Theory, Combinatorics and Applications, Willey, New York 91, 765-782, 1991	95	1991
A Helly-type problem in trees A Gyárfás, J Lehel Combinatorial Theory and its applications 4, 571-584, 1970	92	1970
Bound on the irregularity strength of regular graphs RJ Faudree, J Lehel Colloq. Math. Soc. János Bolyai 52, 247-256, 1987	86	1987
Toughness, hamiltonicity and split graphs D Kratsch, J Lehel, H Müller Discrete Mathematics 150 (1), 231-246, 1996	84	1996
A Ramsey-type problem in directed and bipartite graphs A Gyárfás, J Lehel Periodica Mathematica Hungarica 3 (3-4), 299-304, 1973	83	1973
Ramsey numbers for local colorings A Gyárfás, J Lehel, RH Schelp, Z Tuza Graphs and Combinatorics 3, 267-277, 1987	67	1987
Neighborhood perfect graphs J Lehel, Z Tuza Discrete Mathematics 61 (1), 93-101, 1986	64	1986
Connected graphs without long paths PN Balister, E Győri, J Lehel, RH Schelp Discrete Mathematics 308 (19), 4487-4494, 2008	58	2008
Tough enough chordal graphs are hamiltonian G Chen, MS Jacobson, AE Kézdy, J Lehel Networks: An International Journal 31 (1), 29-38, 1998	50	1998
1ST FIT AND ONLINE CHROMATIC NUMBER OF FAMILIES OF GRAPHS A Gyárfás, J Lehel Ars Combinatoria 29, 168-176, 1990	50	1990
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	49	1987
A characterization of totally balanced hypergraphs J Lehel Discrete mathematics 57 (1-2), 59-65, 1985	49	1985

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用