Jan Ekstein

Available identifiers

Publication	Date of Publication	Type
The most general structure of graphs with Hamiltonian or Hamiltonian connected square	2023-10-30	Paper
A best possible result for the square of a 2-block to be Hamiltonian	2021-01-21	Paper
Hamiltonian properties in generalized lexicographic products	2020-12-18	Paper
Bounding the distance among longest paths in a connected graph	2018-02-23	Paper
Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-graphs	2018-01-15	Paper
3-coloring triangle-free planar graphs with a precolored 9-cycle	2017-11-14	Paper
Connected even factors in the square of essentially 2-edge-connected graph	2017-09-08	Paper
3-coloring triangle-free planar graphs with a precolored 9-cycle	2015-09-29	Paper
3-coloring triangle-free planar graphs with a precolored 9-cycle	2015-09-15	Paper
Radio labelings of distance graphs	2014-04-23	Paper
The packing coloring of distance graphs \(D(k,t)\)	2014-03-27	Paper
The rainbow connection number of 2-connected graphs	2013-12-06	Paper
Star subdivisions and connected even factors in the square of a graph	2012-08-10	Paper
Packing chromatic number of distance graphs	2012-05-04	Paper
Hamiltonian cycles in the square of a graph	2011-11-22	Paper

This page was built for person: Jan Ekstein