default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Ekstein
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Jan Ekstein
, Herbert Fleischner:
The most general structure of graphs with hamiltonian or hamiltonian connected square. Discret. Math. 347(1): 113702 (2024)- 2021
- [j10]Jan Ekstein, Herbert Fleischner:
A best possible result for the square of a 2-block to be hamiltonian. Discret. Math. 344(1): 112158 (2021)
2010 – 2019
- 2018
- [j9]Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska:
Bounding the distance among longest paths in a connected graph. Discret. Math. 341(4): 1155-1159 (2018) - [j8]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68: 38-65 (2018) - 2017
- [j7]Jan Ekstein, Baoyindureng Wu, Liming Xiong:
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. Electron. J. Comb. 24(3): 3 (2017) - 2014
- [j6]Jan Ekstein, Premysl Holub, Olivier Togni:
The packing coloring of distance graphs D(k, t). Discret. Appl. Math. 167: 100-106 (2014) - [c1]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA 2014: 98-109 - 2013
- [j5]Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni:
Radio labelings of distance graphs. Discret. Appl. Math. 161(18): 2876-2884 (2013) - [j4]Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer:
The rainbow connection number of 2-connected graphs. Discret. Math. 313(19): 1884-1892 (2013) - 2012
- [j3]Jan Ekstein, Premysl Holub, Bernard Lidický:
Packing chromatic number of distance graphs. Discret. Appl. Math. 160(4-5): 518-524 (2012) - [j2]Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang:
Star subdivisions and connected even factors in the square of a graph. Discret. Math. 312(17): 2574-2578 (2012) - 2011
- [j1]Jan Ekstein:
Hamiltonian Cycles in the Square of a Graph. Electron. J. Comb. 18(1) (2011) - [i2]Jan Ekstein, Premysl Holub, Bernard Lidický:
Packing Chromatic Number of Distance Graphs. CoRR abs/1105.5652 (2011) - 2010
- [i1]Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický:
The packing chromatic number of the square lattice is at least 12. CoRR abs/1003.2291 (2010)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
