Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jenö Lehel
@article{DBLP:journals/dm/KezdyL23,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {An asymptotic resolution of a conjecture of Szemer{\'{e}}di and
Petruska},
journal = {Discret. Math.},
volume = {346},
number = {8},
pages = {113469},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113469},
doi = {10.1016/J.DISC.2023.113469},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KezdyL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/BiroLT23,
author = {Csaba Bir{\'{o}} and
Jeno Lehel and
G{\'{e}}za T{\'{o}}th},
title = {Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph},
journal = {Order},
volume = {40},
number = {3},
pages = {665--682},
year = {2023},
url = {https://doi.org/10.1007/s11083-023-09625-x},
doi = {10.1007/S11083-023-09625-X},
timestamp = {Thu, 14 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/order/BiroLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11573,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {An asymptotic resolution of a conjecture of Szemer{\'{e}}di and
Petruska},
journal = {CoRR},
volume = {abs/2208.11573},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11573},
doi = {10.48550/ARXIV.2208.11573},
eprinttype = {arXiv},
eprint = {2208.11573},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11573.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JobsonKL21,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Eckhoff's Problem on Convex Sets in the Plane},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
year = {2021},
url = {https://doi.org/10.37236/9978},
doi = {10.37236/9978},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/JobsonKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JobsonKL21,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Minimal 2-connected graphs satisfying the even cut condition},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106080},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106080},
doi = {10.1016/J.IPL.2020.106080},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JobsonKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasL21,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jeno Lehel},
title = {Order plus size of {\unicode{120591}}-critical graphs},
journal = {J. Graph Theory},
volume = {96},
number = {1},
pages = {85--86},
year = {2021},
url = {https://doi.org/10.1002/jgt.22603},
doi = {10.1002/JGT.22603},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/JobsonKL21,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Path-pairability of infinite planar grids},
journal = {Period. Math. Hung.},
volume = {83},
number = {2},
pages = {220--232},
year = {2021},
url = {https://doi.org/10.1007/s10998-021-00381-2},
doi = {10.1007/S10998-021-00381-2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pmh/JobsonKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JobsonKL20,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Note on the bisection width of cubic graphs},
journal = {Discret. Appl. Math.},
volume = {285},
pages = {434--442},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.06.017},
doi = {10.1016/J.DAM.2020.06.017},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JobsonKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JobsonKLPT20,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel and
Timothy J. Pervenecki and
G{\'{e}}za T{\'{o}}th},
title = {Petruska's question on planar convex sets},
journal = {Discret. Math.},
volume = {343},
number = {9},
pages = {111956},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2020.111956},
doi = {10.1016/J.DISC.2020.111956},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/JobsonKLPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/JobsonKLM19,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel and
G{\'{a}}bor M{\'{e}}sz{\'{a}}ros},
title = {The path-pairability number of products of stars},
journal = {Discuss. Math. Graph Theory},
volume = {39},
number = {4},
pages = {909--924},
year = {2019},
url = {https://doi.org/10.7151/dmgt.2114},
doi = {10.7151/DMGT.2114},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/JobsonKLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JobsonKL18,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {The minimum size of graphs satisfying cut conditions},
journal = {Discret. Appl. Math.},
volume = {237},
pages = {89--96},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.11.014},
doi = {10.1016/J.DAM.2017.11.014},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JobsonKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DuFLY18,
author = {Hui Du and
Ralph J. Faudree and
Jeno Lehel and
Kiyoshi Yoshimoto},
title = {A panconnectivity theorem for bipartite graphs},
journal = {Discret. Math.},
volume = {341},
number = {1},
pages = {151--154},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.08.024},
doi = {10.1016/J.DISC.2017.08.024},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DuFLY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JobsonKL18,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Linkage on the infinite grid},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {51--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.001},
doi = {10.1016/J.IPL.2018.05.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JobsonKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GyarfasL16,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jeno Lehel},
title = {Red-Blue Clique Partitions and (1-1)-Transversals},
journal = {Electron. J. Comb.},
volume = {23},
number = {3},
pages = {3},
year = {2016},
url = {https://doi.org/10.37236/5532},
doi = {10.37236/5532},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GyarfasL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JobsonKLW16,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel and
Susan C. White},
title = {Detour trees},
journal = {Discret. Appl. Math.},
volume = {206},
pages = {73--80},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.02.002},
doi = {10.1016/J.DAM.2016.02.002},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JobsonKLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BaratGLS16,
author = {J{\'{a}}nos Bar{\'{a}}t and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jeno Lehel and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy},
title = {Ramsey number of paths and connected matchings in Ore-type host graphs},
journal = {Discret. Math.},
volume = {339},
number = {6},
pages = {1690--1698},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2016.01.014},
doi = {10.1016/J.DISC.2016.01.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BaratGLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FaudreeLY16,
author = {Ralph J. Faudree and
Jen{\"{o}} Lehel and
Kiyoshi Yoshimoto},
title = {Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs},
journal = {Graphs Comb.},
volume = {32},
number = {3},
pages = {963--986},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1626-2},
doi = {10.1007/S00373-015-1626-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FaudreeLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HulganLOY16,
author = {Jonathan Hulgan and
Jeno Lehel and
Kenta Ozeki and
Kiyoshi Yoshimoto},
title = {Vertex Coloring of Graphs by Total 2-Weightings},
journal = {Graphs Comb.},
volume = {32},
number = {6},
pages = {2461--2471},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1712-0},
doi = {10.1007/S00373-016-1712-0},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HulganLOY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BalisterBLM16,
author = {Paul N. Balister and
B{\'{e}}la Bollob{\'{a}}s and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {Random Hypergraph Irregularity},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {465--473},
year = {2016},
url = {https://doi.org/10.1137/120897717},
doi = {10.1137/120897717},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BalisterBLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FaudreeLY14,
author = {Ralph J. Faudree and
Jeno Lehel and
Kiyoshi Yoshimoto},
title = {Note on Locating Pairs of Vertices on Hamiltonian Cycles},
journal = {Graphs Comb.},
volume = {30},
number = {4},
pages = {887--894},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1325-9},
doi = {10.1007/S00373-013-1325-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FaudreeLY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BalisterBLM13,
author = {Paul Balister and
B{\'{e}}la Bollob{\'{a}}s and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {Repeated Degrees in Random Uniform Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {145--154},
year = {2013},
url = {https://doi.org/10.1137/100785156},
doi = {10.1137/100785156},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BalisterBLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasL11,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Trees in greedy colorings of hypergraphs},
journal = {Discret. Math.},
volume = {311},
number = {2-3},
pages = {208--209},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.10.017},
doi = {10.1016/J.DISC.2010.10.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FurediL10,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Jen{\"{o}} Lehel},
title = {Tight embeddings of partial quadrilateral packings},
journal = {J. Comb. Theory, Ser. {A}},
volume = {117},
number = {4},
pages = {466--474},
year = {2010},
url = {https://doi.org/10.1016/j.jcta.2009.06.003},
doi = {10.1016/J.JCTA.2009.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FurediL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CropperHJL10,
author = {Mathew Cropper and
Anthony J. W. Hilton and
Peter D. Johnson Jr. and
Jen{\"{o}} Lehel},
title = {List multicoloring problems involving the \emph{k}-fold Hall numbers},
journal = {J. Graph Theory},
volume = {65},
number = {1},
pages = {16--34},
year = {2010},
url = {https://doi.org/10.1002/jgt.20462},
doi = {10.1002/JGT.20462},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CropperHJL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LehelMP09,
author = {Jen{\"{o}} Lehel and
Fr{\'{e}}d{\'{e}}ric Maffray and
Myriam Preissmann},
title = {Maximum directed cuts in digraphs with degree restriction},
journal = {J. Graph Theory},
volume = {61},
number = {2},
pages = {140--156},
year = {2009},
url = {https://doi.org/10.1002/jgt.20374},
doi = {10.1002/JGT.20374},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LehelMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BalisterGLS08,
author = {Paul N. Balister and
Ervin Gy{\"{o}}ri and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Connected graphs without long paths},
journal = {Discret. Math.},
volume = {308},
number = {19},
pages = {4487--4494},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.08.047},
doi = {10.1016/J.DISC.2007.08.047},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BalisterGLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GyarfasLSS08,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Richard H. Schelp},
title = {Monochromatic Hamiltonian Berge-cycles in colored complete uniform
hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {2},
pages = {342--358},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.07.002},
doi = {10.1016/J.JCTB.2007.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GyarfasLSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasLS07,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Finding a monochromatic subgraph or a rainbow path},
journal = {J. Graph Theory},
volume = {54},
number = {1},
pages = {1--12},
year = {2007},
url = {https://doi.org/10.1002/jgt.20179},
doi = {10.1002/JGT.20179},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlonBGLS07,
author = {Noga Alon and
B{\'{e}}la Bollob{\'{a}}s and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Alex D. Scott},
title = {Maximum directed cuts in acyclic digraphs},
journal = {J. Graph Theory},
volume = {55},
number = {1},
pages = {1--13},
year = {2007},
url = {https://doi.org/10.1002/jgt.20215},
doi = {10.1002/JGT.20215},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlonBGLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BalisterGLS07,
author = {Paul N. Balister and
Ervin Gy{\"{o}}ri and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Adjacent Vertex Distinguishing Edge-Colorings},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {1},
pages = {237--250},
year = {2007},
url = {https://doi.org/10.1137/S0895480102414107},
doi = {10.1137/S0895480102414107},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BalisterGLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-3958,
author = {Jen{\"{o}} Lehel and
Fr{\'{e}}d{\'{e}}ric Maffray and
Myriam Preissmann},
title = {Maximum directed cuts in digraphs with degree restriction},
journal = {CoRR},
volume = {abs/0711.3958},
year = {2007},
url = {http://arxiv.org/abs/0711.3958},
eprinttype = {arXiv},
eprint = {0711.3958},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-3958.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/KubickiLM06,
author = {Grzegorz Kubicki and
Jeno Lehel and
Michal Morayne},
title = {Counting chains and antichains in the complete binary tree},
journal = {Ars Comb.},
volume = {79},
year = {2006},
timestamp = {Wed, 26 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/KubickiLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CropperGL06,
author = {Mathew Cropper and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Hall ratio of the Mycielski graphs},
journal = {Discret. Math.},
volume = {306},
number = {16},
pages = {1988--1990},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.09.020},
doi = {10.1016/J.DISC.2005.09.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CropperGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasJKL06,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {Odd cycles and Theta-cycles in hypergraphs},
journal = {Discret. Math.},
volume = {306},
number = {19-20},
pages = {2481--2491},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.037},
doi = {10.1016/J.DISC.2005.12.037},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GyarfasJKL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BalisterGLS06,
author = {Paul N. Balister and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Mono-multi bipartite Ramsey numbers, designs, and matrices},
journal = {J. Comb. Theory, Ser. {A}},
volume = {113},
number = {1},
pages = {101--112},
year = {2006},
url = {https://doi.org/10.1016/j.jcta.2005.07.003},
doi = {10.1016/J.JCTA.2005.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BalisterGLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BalisterLS06,
author = {Paul N. Balister and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Ramsey unsaturated and saturated graphs},
journal = {J. Graph Theory},
volume = {51},
number = {1},
pages = {22--32},
year = {2006},
url = {https://doi.org/10.1002/jgt.20118},
doi = {10.1002/JGT.20118},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/BalisterLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalisterGLS04,
author = {Paul N. Balister and
Ervin Gy{\"{o}}ri and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Longest Paths in Circular Arc Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {311--317},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006145},
doi = {10.1017/S0963548304006145},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BalisterGLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChangHJLW04,
author = {Yi{-}Wu Chang and
Joan P. Hutchinson and
Michael S. Jacobson and
Jen{\"{o}} Lehel and
Douglas B. West},
title = {The Bar Visibility Number of a Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {462--471},
year = {2004},
url = {https://doi.org/10.1137/S0895480198343455},
doi = {10.1137/S0895480198343455},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChangHJLW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KezdyLP03,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel and
Robert C. Powers},
title = {Heavy Transversals and Indecomposable Hypergraphs},
journal = {Comb.},
volume = {23},
number = {2},
pages = {303--310},
year = {2003},
url = {https://doi.org/10.1007/s00493-003-0023-2},
doi = {10.1007/S00493-003-0023-2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KezdyLP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CropperGL03,
author = {Mathew Cropper and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Edge list multicoloring trees: An extension of Hall's theorem},
journal = {J. Graph Theory},
volume = {42},
number = {3},
pages = {246--255},
year = {2003},
url = {https://doi.org/10.1002/jgt.10093},
doi = {10.1002/JGT.10093},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CropperGL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/KubickiLM03,
author = {Grzegorz Kubicki and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {An Asymptotic Ratio in the Complete Binary Tree},
journal = {Order},
volume = {20},
number = {2},
pages = {91--97},
year = {2003},
url = {https://doi.org/10.1023/B:ORDE.0000009243.79750.85},
doi = {10.1023/B:ORDE.0000009243.79750.85},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/KubickiLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KubickiLM02,
author = {Grzegorz Kubicki and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {A Ratio Inequality For Binary Trees And The Best Secretary},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {149--161},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004977},
doi = {10.1017/S0963548301004977},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KubickiLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KubickiL02,
author = {Grzegorz Kubicki and
Jen{\"{o}} Lehel},
title = {Foreword},
journal = {Discret. Math.},
volume = {249},
number = {1-3},
pages = {1},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00223-0},
doi = {10.1016/S0012-365X(01)00223-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KubickiL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasKL02,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {A finite basis characterization of ?-split colorings},
journal = {Discret. Math.},
volume = {257},
number = {2-3},
pages = {415--421},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00440-5},
doi = {10.1016/S0012-365X(02)00440-5},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GyarfasKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KubickiLM02,
author = {Grzegorz Kubicki and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {Patch Colorings and Rigid Colorings of the Rational n-Space},
journal = {J. Comb. Theory, Ser. {B}},
volume = {84},
number = {1},
pages = {45--53},
year = {2002},
url = {https://doi.org/10.1006/jctb.2001.2062},
doi = {10.1006/JCTB.2001.2062},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KubickiLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFGJL01,
author = {Paul Erd{\"{o}}s and
Ralph J. Faudree and
Ronald J. Gould and
Michael S. Jacobson and
Jen{\"{o}} Lehel},
title = {Edge disjoint monochromatic triangles in 2-colored graphs},
journal = {Discret. Math.},
volume = {231},
number = {1-3},
pages = {135--141},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00312-5},
doi = {10.1016/S0012-365X(00)00312-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosFGJL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenJKLSW00,
author = {Guantao Chen and
Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel and
Edward R. Scheinerman and
Chi Wang},
title = {Clique covering the edges of a locally cobipartite graph},
journal = {Discret. Math.},
volume = {219},
number = {1-3},
pages = {17--26},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00333-7},
doi = {10.1016/S0012-365X(99)00333-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ChenJKLSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FaudreeFJLS00,
author = {Ralph J. Faudree and
Evelyne Flandrin and
Michael S. Jacobson and
Jeno Lehel and
Richard H. Schelp},
title = {Even Cycles in Graphs with Many Odd Cycles},
journal = {Graphs Comb.},
volume = {16},
number = {4},
pages = {399--410},
year = {2000},
url = {https://doi.org/10.1007/s003730070004},
doi = {10.1007/S003730070004},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FaudreeFJLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/JacobsonKL99,
author = {Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Scenic graphs {II:} non-traceable graphs},
journal = {Australas. {J} Comb.},
volume = {19},
pages = {287},
year = {1999},
url = {http://ajc.maths.uq.edu.au/pdf/19/ocr-ajc-v19-p287.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/JacobsonKL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/LehelL99,
author = {Jen{\"{o}} Lehel and
Inessa Levi},
title = {Loops With Partitions and Matchings},
journal = {Ars Comb.},
volume = {54},
year = {1999},
timestamp = {Fri, 28 Apr 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/LehelL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GyarfasKL99,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Zolt{\'{a}}n Kir{\'{a}}ly and
Jen{\"{o}} Lehel},
title = {On-Line 3-Chromatic Graphs I. Triangle-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {3},
pages = {385--411},
year = {1999},
url = {https://doi.org/10.1137/S089548019631030X},
doi = {10.1137/S089548019631030X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GyarfasKL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/JacobsonKL98,
author = {Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {Scenic Graphs {I:} Traceable Graphs},
journal = {Ars Comb.},
volume = {49},
year = {1998},
timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/JacobsonKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChenLJS98,
author = {Guantao Chen and
Jen{\"{o}} Lehel and
Michael S. Jacobson and
Warren E. Shreve},
title = {Note on graphs without repeated cycle lengths},
journal = {J. Graph Theory},
volume = {29},
number = {1},
pages = {11--15},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199809)29:1\&\#60;11::AID-JGT2\&\#62;3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0118(199809)29:1\&\#60;11::AID-JGT2\&\#62;3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChenLJS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JacobsonKL98,
author = {Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {Recognizing triangle-free graphs with induced path-cycle double covers
is NP-complete},
journal = {Networks},
volume = {31},
number = {1},
pages = {1--10},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199801)31:1\&\#60;1::AID-NET1\&\#62;3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0037(199801)31:1\&\#60;1::AID-NET1\&\#62;3.0.CO;2-N},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/JacobsonKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenJKL98,
author = {Guantao Chen and
Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {Tough enough chordal graphs are Hamiltonian},
journal = {Networks},
volume = {31},
number = {1},
pages = {29--38},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199801)31:1\&\#60;29::AID-NET4\&\#62;3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0037(199801)31:1\&\#60;29::AID-NET4\&\#62;3.0.CO;2-M},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChenJKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lehel97,
author = {Jen{\"{o}} Lehel},
title = {The partition of a uniform hypergraph into pairs of dependent hyperedges},
journal = {Discret. Math.},
volume = {163},
number = {1-3},
pages = {313--318},
year = {1997},
url = {https://doi.org/10.1016/0012-365X(95)00322-N},
doi = {10.1016/0012-365X(95)00322-N},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lehel97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasKL97,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Zolt{\'{a}}n Kir{\'{a}}ly and
Jen{\"{o}} Lehel},
title = {On-line 3-chromatic graphs - {II} critical graphs},
journal = {Discret. Math.},
volume = {177},
number = {1-3},
pages = {99--122},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00359-7},
doi = {10.1016/S0012-365X(96)00359-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasKL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/JacobsonKL97,
author = {Michael S. Jacobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jen{\"{o}} Lehel},
title = {Recognizing Intersection Graphs of Linear Uniform Hypergraphs},
journal = {Graphs Comb.},
volume = {13},
number = {4},
pages = {359--367},
year = {1997},
url = {https://doi.org/10.1007/BF03353014},
doi = {10.1007/BF03353014},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/JacobsonKL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LehelMP96,
author = {Jen{\"{o}} Lehel and
Fr{\'{e}}d{\'{e}}ric Maffray and
Myriam Preissmann},
title = {Graphs with Largest Number of Minimum Cuts},
journal = {Discret. Appl. Math.},
volume = {65},
number = {1-3},
pages = {387--407},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00043-Q},
doi = {10.1016/0166-218X(95)00043-Q},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LehelMP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeGJLL96,
author = {Ralph J. Faudree and
Ronald J. Gould and
Michael S. Jacobson and
Jen{\"{o}} Lehel and
Linda M. Lesniak},
title = {Graph spectra},
journal = {Discret. Math.},
volume = {150},
number = {1-3},
pages = {103--113},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00179-Z},
doi = {10.1016/0012-365X(95)00179-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeGJLL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KratschLM96,
author = {Dieter Kratsch and
Jen{\"{o}} Lehel and
Haiko M{\"{u}}ller},
title = {Toughness, hamiltonicity and split graphs},
journal = {Discret. Math.},
volume = {150},
number = {1-3},
pages = {231--245},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00190-8},
doi = {10.1016/0012-365X(95)00190-8},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KratschLM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasKLM96,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Dieter Kratsch and
Jen{\"{o}} Lehel and
Fr{\'{e}}d{\'{e}}ric Maffray},
title = {Minimal non-neighborhood-perfect graphs},
journal = {J. Graph Theory},
volume = {21},
number = {1},
pages = {55--66},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199601)21:1\&\#60;55::AID-JGT8\&\#62;3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199601)21:1\&\#60;55::AID-JGT8\&\#62;3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasKLM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JacobsonL95,
author = {Michael S. Jacobson and
Jen{\"{o}} Lehel},
title = {Irregular embeddings of hypergraphs with fixed chromatic number},
journal = {Discret. Math.},
volume = {145},
number = {1-3},
pages = {145--150},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00101-N},
doi = {10.1016/0012-365X(94)00101-N},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JacobsonL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JacobsonL95a,
author = {Michael S. Jacobson and
Jen{\"{o}} Lehel},
title = {Irregular embeddings of multigraphs with fixed chromatic number},
journal = {Discret. Math.},
volume = {145},
number = {1-3},
pages = {295--299},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00042-H},
doi = {10.1016/0012-365X(94)00042-H},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JacobsonL95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GyarfasL95,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Linear Sets with Five Distinct Differences among Any Four Elements},
journal = {J. Comb. Theory, Ser. {B}},
volume = {64},
number = {1},
pages = {108--118},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1028},
doi = {10.1006/JCTB.1995.1028},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GyarfasL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeSLGL94,
author = {Ralph J. Faudree and
Richard H. Schelp and
Linda M. Lesniak and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {On the rotation distance of graphs},
journal = {Discret. Math.},
volume = {126},
number = {1-3},
pages = {121--135},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90258-5},
doi = {10.1016/0012-365X(94)90258-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeSLGL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Lehel94,
author = {Jen{\"{o}} Lehel},
title = {Neighbourhood-Perfect Line Graphs},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {353--361},
year = {1994},
url = {https://doi.org/10.1007/BF02986685},
doi = {10.1007/BF02986685},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Lehel94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacobsonLL93,
author = {Michael S. Jacobson and
Jen{\"{o}} Lehel and
Linda M. Lesniak},
title = {{\O}-Threshold and {\O}-Tolerance Chain Graphs},
journal = {Discret. Appl. Math.},
volume = {44},
number = {1-3},
pages = {191--203},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90231-C},
doi = {10.1016/0166-218X(93)90231-C},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JacobsonLL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FaudreeGL92,
author = {Ralph J. Faudree and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Three-regular path pairable graphs},
journal = {Graphs Comb.},
volume = {8},
number = {1},
pages = {45--52},
year = {1992},
url = {https://doi.org/10.1007/BF01271707},
doi = {10.1007/BF01271707},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FaudreeGL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CsabaFGLS92,
author = {L{\'{a}}szl{\'{o}} Csaba and
Ralph J. Faudree and
Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Networks communicating for each pairing of terminals},
journal = {Networks},
volume = {22},
number = {7},
pages = {615--626},
year = {1992},
url = {https://doi.org/10.1002/net.3230220702},
doi = {10.1002/NET.3230220702},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CsabaFGLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasL91,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Effective on-line coloring of P\({}_{\mbox{5}}\)-free graphs},
journal = {Comb.},
volume = {11},
number = {2},
pages = {181--184},
year = {1991},
url = {https://doi.org/10.1007/BF01206361},
doi = {10.1007/BF01206361},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeJKL91,
author = {Ralph J. Faudree and
Michael S. Jacobson and
Lael F. Kinch and
Jen{\"{o}} Lehel},
title = {Irregularity strength of dense graphs},
journal = {Discret. Math.},
volume = {91},
number = {1},
pages = {45--59},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90161-T},
doi = {10.1016/0012-365X(91)90161-T},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeJKL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KinchL91,
author = {Lael F. Kinch and
Jen{\"{o}} Lehel},
title = {The irregularity strength of tP\({}_{\mbox{3}}\)},
journal = {Discret. Math.},
volume = {94},
number = {1},
pages = {75--79},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90309-P},
doi = {10.1016/0012-365X(91)90309-P},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KinchL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelMS89,
author = {Jen{\"{o}} Lehel and
Fred R. McMorris and
Debra D. Scott},
title = {M-chain graphs of posets},
journal = {Discret. Math.},
volume = {74},
number = {3},
pages = {341--346},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90149-0},
doi = {10.1016/0012-365X(89)90149-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelMS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeSJL89,
author = {Ralph J. Faudree and
Richard H. Schelp and
Michael S. Jacobson and
Jen{\"{o}} Lehel},
title = {Irregular networks, regular graphs and integer matrices with distinct
row and column sums},
journal = {Discret. Math.},
volume = {76},
number = {3},
pages = {223--240},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90321-X},
doi = {10.1016/0012-365X(89)90321-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeSJL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lehel89,
author = {Jen{\"{o}} Lehel},
title = {The minimum number of triangles covering the edges of a graph},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {369--384},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130312},
doi = {10.1002/JGT.3190130312},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lehel89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasLT88,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Clumsy packing of dominoes},
journal = {Discret. Math.},
volume = {71},
number = {1},
pages = {33--46},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90028-3},
doi = {10.1016/0012-365X(88)90028-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasLT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Lehel88,
author = {Jen{\"{o}} Lehel},
title = {Gallai-type Results for Multiple Boxes and Forests},
journal = {Eur. J. Comb.},
volume = {9},
number = {2},
pages = {113--120},
year = {1988},
url = {https://doi.org/10.1016/S0195-6698(88)80035-0},
doi = {10.1016/S0195-6698(88)80035-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Lehel88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GyarfasL88,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {On-line and first fit colorings of graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {217--227},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120212},
doi = {10.1002/JGT.3190120212},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GyarfasL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BaranyL87,
author = {Imre B{\'{a}}r{\'{a}}ny and
Jen{\"{o}} Lehel},
title = {Covering with Euclidean Boxes},
journal = {Eur. J. Comb.},
volume = {8},
number = {2},
pages = {113--119},
year = {1987},
url = {https://doi.org/10.1016/S0195-6698(87)80001-X},
doi = {10.1016/S0195-6698(87)80001-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BaranyL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GyarfasLST87,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jeno Lehel and
Richard H. Schelp and
Zsolt Tuza},
title = {Ramsey numbers for local colorings},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {267--277},
year = {1987},
url = {https://doi.org/10.1007/BF01788549},
doi = {10.1007/BF01788549},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GyarfasLST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GyarfasLNRST87,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Jaroslav Nesetril and
Vojtech R{\"{o}}dl and
Richard H. Schelp and
Zsolt Tuza},
title = {Local \emph{k}-colorings of graphs and hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {43},
number = {2},
pages = {127--139},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90017-7},
doi = {10.1016/0095-8956(87)90017-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GyarfasLNRST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT86,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Neighborhood perfect graphs},
journal = {Discret. Math.},
volume = {61},
number = {1},
pages = {93--101},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90031-2},
doi = {10.1016/0012-365X(86)90031-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasLT85,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {How many atoms can be defined by boxes},
journal = {Comb.},
volume = {5},
number = {3},
pages = {193--204},
year = {1985},
url = {https://doi.org/10.1007/BF02579362},
doi = {10.1007/BF02579362},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasLT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasL85,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Covering and coloring problems for relatives of intervals},
journal = {Discret. Math.},
volume = {55},
number = {2},
pages = {167--180},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90045-7},
doi = {10.1016/0012-365X(85)90045-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lehel85,
author = {Jen{\"{o}} Lehel},
title = {A characterization of totally balanced hypergraphs},
journal = {Discret. Math.},
volume = {57},
number = {1-2},
pages = {59--65},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90156-6},
doi = {10.1016/0012-365X(85)90156-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lehel85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GyarfasLT84,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {The structure of rectangle families dividing the plane into maximum
number of atoms},
journal = {Discret. Math.},
volume = {52},
number = {2-3},
pages = {177--198},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90080-3},
doi = {10.1016/0012-365X(84)90080-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GyarfasLT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasL83,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel},
title = {Hypergraph families with bounded edge cover or transversal number},
journal = {Comb.},
volume = {3},
number = {3},
pages = {351--358},
year = {1983},
url = {https://doi.org/10.1007/BF02579191},
doi = {10.1007/BF02579191},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Lehel82,
author = {Jen{\"{o}} Lehel},
title = {Covers in hypergraphs},
journal = {Comb.},
volume = {2},
number = {3},
pages = {305--309},
year = {1982},
url = {https://doi.org/10.1007/BF02579237},
doi = {10.1007/BF02579237},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Lehel82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT82,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Triangle-free partial graphs and edge covering theorems},
journal = {Discret. Math.},
volume = {39},
number = {1},
pages = {59--65},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90040-1},
doi = {10.1016/0012-365X(82)90040-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lehel81,
author = {Jen{\"{o}} Lehel},
title = {Generating all 4-regular planar graphs from the graph of the octahedron},
journal = {J. Graph Theory},
volume = {5},
number = {4},
pages = {423--426},
year = {1981},
url = {https://doi.org/10.1002/jgt.3190050412},
doi = {10.1002/JGT.3190050412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lehel81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lehel80,
author = {Jen{\"{o}} Lehel},
title = {Deltahedra are realizable as simplicial convex polyhedra},
journal = {Discret. Appl. Math.},
volume = {2},
number = {1},
pages = {81--84},
year = {1980},
url = {https://doi.org/10.1016/0166-218X(80)90058-X},
doi = {10.1016/0166-218X(80)90058-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lehel80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LehelT80,
author = {Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {Ensembles d'articulation d'un graphe {\(\gamma\)}-critique},
journal = {Discret. Math.},
volume = {30},
number = {3},
pages = {245--248},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90231-9},
doi = {10.1016/0012-365X(80)90231-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LehelT80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
