Marián Klešč

441 total citations
23 papers, 261 citations indexed

About

Marián Klešč is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Marián Klešč has authored 23 papers receiving a total of 261 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Graphics and Computer-Aided Design, 19 papers in Computational Theory and Mathematics and 6 papers in Computer Vision and Pattern Recognition. Recurrent topics in Marián Klešč's work include Computational Geometry and Mesh Generation (21 papers), Advanced Graph Theory Research (18 papers) and Graph Labeling and Dimension Problems (12 papers). Marián Klešč is often cited by papers focused on Computational Geometry and Mesh Generation (21 papers), Advanced Graph Theory Research (18 papers) and Graph Labeling and Dimension Problems (12 papers). Marián Klešč collaborates with scholars based in Slovakia. Marián Klešč's co-authors include and has published in prestigious journals such as Discrete Mathematics, Journal of Graph Theory and Graphs and Combinatorics.

In The Last Decade

Marián Klešč

21 papers receiving 236 citations

Peers

Marián Klešč
Michael J. Pelsmajer United States
Radoslav Fulek Switzerland
Attila Pór United States
Michael J. Pelsmajer United States
Marián Klešč
Citations per year, relative to Marián Klešč Marián Klešč (= 1×) peers Michael J. Pelsmajer

Countries citing papers authored by Marián Klešč

Since Specialization
Citations

This map shows the geographic impact of Marián Klešč's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marián Klešč with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marián Klešč more than expected).

Fields of papers citing papers by Marián Klešč

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marián Klešč. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marián Klešč. The network helps show where Marián Klešč may publish in the future.

No nodes

All Works

20 of 20 papers shown
1.
Klešč, Marián, et al.. (2022). The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs. Graphs and Combinatorics. 38(2). 5 indexed citations
2.
Klešč, Marián, et al.. (2017). On the crossing numbers of Cartesian products of wheels and trees. Discussiones Mathematicae Graph Theory. 37(2). 399–399. 16 indexed citations
3.
Klešč, Marián, et al.. (2014). On the crossing numbers of Cartesian products of paths with special graphs. Carpathian Journal of Mathematics. 30(3). 317–325. 3 indexed citations
4.
Klešč, Marián, et al.. (2013). Minimal number of crossings in strong product of paths. Carpathian Journal of Mathematics. 29(1). 27–32. 5 indexed citations
5.
Klešč, Marián, et al.. (2013). On the crossing numbers of Cartesian products of stars and graphs of order six. Discussiones Mathematicae Graph Theory. 33(3). 583–583. 5 indexed citations
6.
Klešč, Marián, et al.. (2012). On Cartesian products with small crossing numbers. Carpathian Journal of Mathematics. 28(1). 67–75. 1 indexed citations
7.
Klešč, Marián, et al.. (2012). On the packing chromatic number of semiregular polyhedra. Acta Electrotechnica et Informatica. 12(3). 1 indexed citations
8.
Klešč, Marián, et al.. (2012). Minimum crossings in join of graphs with paths and cycles. Acta Electrotechnica et Informatica. 12(3). 8 indexed citations
9.
Klešč, Marián, et al.. (2011). The crossing number of Pn2C3. Discrete Mathematics. 312(14). 2096–2101. 2 indexed citations
10.
Klešč, Marián, et al.. (2011). The crossing numbers of join products of paths with graphs of order four. Discussiones Mathematicae Graph Theory. 31(2). 321–321. 31 indexed citations
11.
Klešč, Marián, et al.. (2011). On the crossing numbers of G□ Cn for graphs G on six vertices. Discussiones Mathematicae Graph Theory. 31(2). 239–239. 1 indexed citations
12.
Klešč, Marián. (2009). The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Mathematics. 310(9). 1475–1481. 29 indexed citations
13.
Klešč, Marián, et al.. (2006). The crossing numbers of products of 5-vertex graphs with cycles. Discrete Mathematics. 307(11-12). 1395–1403. 5 indexed citations
14.
Klešč, Marián. (2005). Some crossing numbers of products of cycles. Discussiones Mathematicae Graph Theory. 25(1-2). 197–197. 6 indexed citations
15.
Klešč, Marián. (2002). The crossing number of K2,3×C3. Discrete Mathematics. 251(1-3). 109–117. 8 indexed citations
16.
Klešč, Marián. (2001). The crossing numbers of Cartesian products of paths with 5-vertex graphs. Discrete Mathematics. 233(1-3). 353–359. 27 indexed citations
17.
Klešč, Marián. (2001). On the Crossing Numbers of Products of Stars and Graphs of Order Five. Graphs and Combinatorics. 17(2). 289–294. 16 indexed citations
18.
Klešč, Marián. (1999). The crossing numbers of products of a 5-vertex graph with paths and cycles. Discussiones Mathematicae Graph Theory. 19(1). 59–59. 3 indexed citations
19.
Klešč, Marián. (1994). The crossing numbers of products of paths and stars with 4‐vertex graphs. Journal of Graph Theory. 18(6). 605–614. 26 indexed citations
20.
Klešč, Marián. (1991). On the crossing numbers of Cartesian products of stars and paths or cycles. Mathematica Slovaca. 41(2). 113–120. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026