


default search action
BibTeX records: Jan Ekstein
@article{DBLP:journals/dmgt/EksteinT25,
author = {Jan Ekstein and
Jakub Teska},
title = {Hamiltonian properties in generalized lexicographic products},
journal = {Discuss. Math. Graph Theory},
volume = {45},
number = {1},
pages = {219--237},
year = {2025},
url = {https://doi.org/10.7151/dmgt.2527},
doi = {10.7151/DMGT.2527},
timestamp = {Sat, 11 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/EksteinT25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinF24,
author = {Jan Ekstein and
Herbert Fleischner},
title = {The most general structure of graphs with hamiltonian or hamiltonian
connected square},
journal = {Discret. Math.},
volume = {347},
number = {1},
pages = {113702},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113702},
doi = {10.1016/J.DISC.2023.113702},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinF21,
author = {Jan Ekstein and
Herbert Fleischner},
title = {A best possible result for the square of a 2-block to be hamiltonian},
journal = {Discret. Math.},
volume = {344},
number = {1},
pages = {112158},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112158},
doi = {10.1016/J.DISC.2020.112158},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinFKT18,
author = {Jan Ekstein and
Shinya Fujita and
Adam Kabela and
Jakub Teska},
title = {Bounding the distance among longest paths in a connected graph},
journal = {Discret. Math.},
volume = {341},
number = {4},
pages = {1155--1159},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.09.029},
doi = {10.1016/J.DISC.2017.09.029},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinFKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ChoiEHL18,
author = {Ilkyoo Choi and
Jan Ekstein and
Premysl Holub and
Bernard Lidick{\'{y}}},
title = {3-coloring triangle-free planar graphs with a precolored 9-cycle},
journal = {Eur. J. Comb.},
volume = {68},
pages = {38--65},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.07.010},
doi = {10.1016/J.EJC.2017.07.010},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/ChoiEHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/EksteinWX17,
author = {Jan Ekstein and
Baoyindureng Wu and
Liming Xiong},
title = {Connected Even Factors in the Square of Essentially 2-Edge-connected
Graph},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
url = {https://doi.org/10.37236/5467},
doi = {10.37236/5467},
timestamp = {Mon, 01 Dec 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/EksteinWX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EksteinHT14,
author = {Jan Ekstein and
Premysl Holub and
Olivier Togni},
title = {The packing coloring of distance graphs D(k, t)},
journal = {Discret. Appl. Math.},
volume = {167},
pages = {100--106},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.10.036},
doi = {10.1016/J.DAM.2013.10.036},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EksteinHT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ChoiEHL14,
author = {Ilkyoo Choi and
Jan Ekstein and
Premysl Holub and
Bernard Lidick{\'{y}}},
editor = {Jan Kratochv{\'{\i}}l and
Mirka Miller and
Dalibor Froncek},
title = {3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle},
booktitle = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8986},
pages = {98--109},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-19315-1\_9},
doi = {10.1007/978-3-319-19315-1\_9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/ChoiEHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CadaEHT13,
author = {Roman Cada and
Jan Ekstein and
Premysl Holub and
Olivier Togni},
title = {Radio labelings of distance graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2876--2884},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.024},
doi = {10.1016/J.DAM.2013.06.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CadaEHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinHKKCRS13,
author = {Jan Ekstein and
Premysl Holub and
Tom{\'{a}}s Kaiser and
Maria Koch and
Stephan Matos Camacho and
Zdenek Ryj{\'{a}}cek and
Ingo Schiermeyer},
title = {The rainbow connection number of 2-connected graphs},
journal = {Discret. Math.},
volume = {313},
number = {19},
pages = {1884--1892},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.04.022},
doi = {10.1016/J.DISC.2012.04.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinHKKCRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EksteinHL12,
author = {Jan Ekstein and
Premysl Holub and
Bernard Lidick{\'{y}}},
title = {Packing chromatic number of distance graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {4-5},
pages = {518--524},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.11.022},
doi = {10.1016/J.DAM.2011.11.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EksteinHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinHKXZ12,
author = {Jan Ekstein and
Premysl Holub and
Tom{\'{a}}s Kaiser and
Liming Xiong and
Shenggui Zhang},
title = {Star subdivisions and connected even factors in the square of a graph},
journal = {Discret. Math.},
volume = {312},
number = {17},
pages = {2574--2578},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.09.004},
doi = {10.1016/J.DISC.2011.09.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinHKXZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Ekstein11,
author = {Jan Ekstein},
title = {Hamiltonian Cycles in the Square of a Graph},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/690},
doi = {10.37236/690},
timestamp = {Mon, 01 Dec 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/Ekstein11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-5652,
author = {Jan Ekstein and
Premysl Holub and
Bernard Lidick{\'{y}}},
title = {Packing Chromatic Number of Distance Graphs},
journal = {CoRR},
volume = {abs/1105.5652},
year = {2011},
url = {http://arxiv.org/abs/1105.5652},
eprinttype = {arXiv},
eprint = {1105.5652},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-5652.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-2291,
author = {Jan Ekstein and
Jir{\'{\i}} Fiala and
Premysl Holub and
Bernard Lidick{\'{y}}},
title = {The packing chromatic number of the square lattice is at least 12},
journal = {CoRR},
volume = {abs/1003.2291},
year = {2010},
url = {http://arxiv.org/abs/1003.2291},
eprinttype = {arXiv},
eprint = {1003.2291},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-2291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













