default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarián Klesc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Marián Klesc, Michal Stas
:
Cyclic permutations in determining crossing numbers. Discuss. Math. Graph Theory 42(4): 1163-1183 (2022)- [j18]Marián Klesc, Michal Stas, Jana Petrillová:
The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs. Graphs Comb. 38(2): 35 (2022)
2010 – 2019
- 2017
- [j17]Marián Klesc, Jana Petrillová, Matús Valo:
On the crossing numbers of Cartesian products of wheels and trees. Discuss. Math. Graph Theory 37(2): 399-413 (2017) - 2013
- [j16]Marián Klesc, Jana Petrillová:
The crossing numbers of products of path with graphs of order six. Discuss. Math. Graph Theory 33(3): 571-582 (2013) - [j15]Marián Klesc, Stefan Schrötter:
On the crossing numbers of Cartesian products of stars and graphs of order six. Discuss. Math. Graph Theory 33(3): 583-597 (2013) - 2012
- [j14]Marián Klesc, Daniela Kravecová:
The crossing number of P2n C3. Discret. Math. 312(14): 2096-2101 (2012) - 2011
- [j13]Emilia Drazenská, Marián Klesc:
On the crossing numbers of G\Box Cn for graphs G on six vertices. Discuss. Math. Graph Theory 31(2): 239-252 (2011) - [j12]Marián Klesc, Stefan Schrötter:
The crossing numbers of join products of paths with graphs of order four. Discuss. Math. Graph Theory 31(2): 321-331 (2011) - [c2]Marián Klesc, Stefan Schrötter:
The Crossing Numbers of Join of Paths and Cycles with Two Graphs of Order Five. MMCP 2011: 160-167 - 2010
- [j11]Marián Klesc:
The crossing numbers of join of the special graph on six vertices with path and cycle. Discret. Math. 310(9): 1475-1481 (2010)
2000 – 2009
- 2009
- [c1]Marián Klesc:
On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices. IWOCA 2009: 324-333 - 2007
- [j10]Marián Klesc, Anna Kocúrová:
The crossing numbers of products of 5-vertex graphs with cycles. Discret. Math. 307(11-12): 1395-1403 (2007) - [j9]Marián Klesc:
The Join of Graphs and Crossing Numbers. Electron. Notes Discret. Math. 28: 349-355 (2007) - 2005
- [j8]Marián Klesc:
Some crossing numbers of products of cycles. Discuss. Math. Graph Theory 25(1-2): 197-210 (2005) - 2002
- [j7]Marián Klesc:
The crossing number of K2, 3xC3. Discret. Math. 251(1-3): 109-117 (2002) - 2001
- [j6]Marián Klesc:
The crossing numbers of Cartesian products of paths with 5-vertex graphs. Discret. Math. 233(1-3): 353-359 (2001) - [j5]Marián Klesc:
On the Crossing Numbers of Products of Stars and Graphs of Order Five. Graphs Comb. 17(2): 289-294 (2001) - [j4]Stanislav Jendrol', Marián Klesc:
On graphs whose line graphs have crossing number one. J. Graph Theory 37(3): 181-188 (2001)
1990 – 1999
- 1999
- [j3]Marián Klesc:
The crossing numbers of products of a 5-vertex graph with paths and cycles. Discuss. Math. Graph Theory 19(1): 59-69 (1999) - 1996
- [j2]Marián Klesc, R. Bruce Richter, Ian Stobert:
The crossing number of C5 × Cn. J. Graph Theory 22(3): 239-243 (1996) - 1995
- [j1]Marián Klesc:
The crossing numbers of certain Cartesian products. Discuss. Math. Graph Theory 15(1): 5-10 (1995)
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-24 22:54 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:
