Jan Ekstein

Orcid: 0000-0003-0047-7549

According to our database1, Jan Ekstein authored at least 13 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Hamiltonian properties in generalized lexicographic products.
Discuss. Math. Graph Theory, 2025

2024
The most general structure of graphs with hamiltonian or hamiltonian connected square.
Discret. Math., January, 2024

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

2018
3-coloring triangle-free planar graphs with a precolored 9-cycle.
Eur. J. Comb., 2018

Bounding the distance among longest paths in a connected graph.
Discret. Math., 2018

2017
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph.
Electron. J. Comb., 2017

2014
The packing coloring of distance graphs D(k, t).
Discret. Appl. Math., 2014

2013
The rainbow connection number of 2-connected graphs.
Discret. Math., 2013

Radio labelings of distance graphs.
Discret. Appl. Math., 2013

2012
Star subdivisions and connected even factors in the square of a graph.
Discret. Math., 2012

Packing chromatic number of distance graphs.
Discret. Appl. Math., 2012

2011
Hamiltonian Cycles in the Square of a Graph.
Electron. J. Comb., 2011

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


  Loading...