Jan Ekstein - RankMe

15 papers C 1Journal 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Hamiltonian properties in generalized lexicographic products. Discuss. Math. Graph Theory Jan Ekstein, Jakub Teska
2024	J	`jnl`	The most general structure of graphs with hamiltonian or hamiltonian connected square. Discret. Math. Jan Ekstein, Herbert Fleischner
2021	J	`jnl`	A best possible result for the square of a 2-block to be hamiltonian. Discret. Math. Jan Ekstein, Herbert Fleischner
2018	J	`jnl`	3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
2018	J	`jnl`	Bounding the distance among longest paths in a connected graph. Discret. Math. Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska
2017	J	`jnl`	Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. Electron. J. Comb. Jan Ekstein, Baoyindureng Wu, Liming Xiong
2014	C	`conf`	3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
2014	J	`jnl`	The packing coloring of distance graphs D(k, t). Discret. Appl. Math. Jan Ekstein, Premysl Holub, Olivier Togni
2013	J	`jnl`	Radio labelings of distance graphs. Discret. Appl. Math. Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni
2013	J	`jnl`	The rainbow connection number of 2-connected graphs. Discret. Math. Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer
2012	J	`jnl`	Packing chromatic number of distance graphs. Discret. Appl. Math. Jan Ekstein, Premysl Holub, Bernard Lidický
2012	J	`jnl`	Star subdivisions and connected even factors in the square of a graph. Discret. Math. Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang
2011	J	`jnl`	Hamiltonian Cycles in the Square of a Graph. Electron. J. Comb. Jan Ekstein
2011	J	`jnl`	Packing Chromatic Number of Distance Graphs CoRR Jan Ekstein, Premysl Holub, Bernard Lidický
2010	J	`jnl`	The packing chromatic number of the square lattice is at least 12 CoRR Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický