Jan Ekstein

According to our database, Jan Ekstein authored at least 12 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The most general structure of graphs with hamiltonian or hamiltonian connected square.

Jan Ekstein, Herbert Fleischner

Discret. Math., January, 2024

2021

A best possible result for the square of a 2-block to be hamiltonian.

Jan Ekstein, Herbert Fleischner

Discret. Math., 2021

2018

3-coloring triangle-free planar graphs with a precolored 9-cycle.

Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický

Eur. J. Comb., 2018

Bounding the distance among longest paths in a connected graph.

Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska

Discret. Math., 2018

2017

Connected Even Factors in the Square of Essentially 2-Edge-connected Graph.

Jan Ekstein, Baoyindureng Wu, Liming Xiong

Electron. J. Comb., 2017

2014

The packing coloring of distance graphs D(k, t).

Jan Ekstein, Premysl Holub, Olivier Togni

Discret. Appl. Math., 2014

2013

The rainbow connection number of 2-connected graphs.

Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer

Discret. Math., 2013

Radio labelings of distance graphs.

Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni

Discret. Appl. Math., 2013

2012

Star subdivisions and connected even factors in the square of a graph.

Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang

Discret. Math., 2012

Packing chromatic number of distance graphs.

Jan Ekstein, Premysl Holub, Bernard Lidický

Discret. Appl. Math., 2012

2011

Hamiltonian Cycles in the Square of a Graph.

Jan Ekstein

Electron. J. Comb., 2011

2010

The packing chromatic number of the square lattice is at least 12

Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický

CoRR, 2010