This map shows the geographic impact of Ján Plesnı́k'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 Ján Plesnı́k with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ján Plesnı́k more than expected).
This network shows the impact of papers produced by Ján Plesnı́k. 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 Ján Plesnı́k. The network helps show where Ján Plesnı́k may publish in the future.
Co-authorship network of co-authors of Ján Plesnı́k
This figure shows the co-authorship network connecting the top 25 collaborators of Ján Plesnı́k.
A scholar is included among the top collaborators of Ján Plesnı́k based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Ján Plesnı́k. Ján Plesnı́k is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Plesnı́k, Ján. (2008). Examples of goal-minimally k-diametric graphs for some small values of k.. Australas. J Comb.. 41. 93–106.2 indexed citations
Branković, Ljiljana, Mirka Miller, Ján Plesnı́k, Joe Ryan, & Jozef Širáň. (1998). Large graphs with small degree and diameter: a voltage assignment approach.. Australas. J Comb.. 18. 65–76.9 indexed citations
6.
Baskoro, Edy Tri, et al.. (1994). Regular digraphs of diameter 2 and maximum order.. Australas. J Comb.. 9. 291–306.13 indexed citations
7.
Plesnı́k, Ján & Štefan Znám. (1989). On equality of edge-connectivity and minimum degree of a graph. Archivum Mathematicum. 25. 19–25.27 indexed citations
8.
Plesnı́k, Ján. (1988). Two heuristics for the absolute $p$-center problem in graphs. Mathematica Slovaca. 38(3). 227–233.2 indexed citations
9.
Plesnı́k, Ján. (1987). On the interchange heuristic for locating centers and medians in a graph. Mathematica Slovaca. 37(2). 209–216.1 indexed citations
10.
Plesnı́k, Ján. (1986). On minimal graphs of diameter $2$ with every edge in a $3$-cycle. Mathematica Slovaca. 36(2). 145–149.6 indexed citations
11.
Plesnı́k, Ján. (1982). Complexity of decomposing graphs into factors with given diameters or radii. Mathematica Slovaca. 32(4). 379–388.7 indexed citations
12.
Plesnı́k, Ján. (1981). A bound for the Steiner tree problem in graphs. Mathematica Slovaca. 31(2). 155–163.40 indexed citations
13.
Plesnı́k, Ján. (1980). Coloring of graphs by partitioning. Mathematica Slovaca. 30(2). 121–126.
14.
Plesnı́k, Ján. (1977). Two constructions of geodetic graphs. Mathematica Slovaca. 27(1). 65–71.11 indexed citations
15.
Plesnı́k, Ján. (1975). A Simple Proof of the Perfect Matching Theorem. Czech digital mathematics library. 25(2). 185–188.1 indexed citations
Plesnı́k, Ján. (1972). Connectivity of Regular Graphs and the Existence of 1-Factors. Czech digital mathematics library. 22(4). 310–318.43 indexed citations
20.
Plesnı́k, Ján, et al.. (1969). On the Extension of Graphs with a Given Diameter without Superfluous Edges. Czech digital mathematics library. 19(2). 92–101.7 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.