Tomaž Pisanski
Impact in
-
- Finite Group Theory Research
- Geometry and Topology top 0.5%
- Graph theory and applications
Papers in
-
- Finite Group Theory Research 40
- Limits and Structures in Graph Theory 11
-
- Graph theory and applications 33
- Co-authors
- Ante GraovacBojan MoharMilan RandićPatrick W. FowlerMarko BobenJanez ŽerovnikDragan MarušičJohn Shawe‐Taylor
- Journals
- Discrete Mathematics (20 papers)Ars Mathematica Contemporanea (10 papers)Journal of Graph Theory (8 papers)European Journal of Combinatorics (7 papers)The Electronic Journal of Combinatorics (6 papers)
- Partner nations
- SloveniaUnited StatesUnited Kingdom
In The Last Decade
Tomaž Pisanski
140 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 113
- Discrete Mathematics and Combinatorics 489
- Geometry and Topology 676
- Computational Theory and Mathematics 737
- Computer Graphics and Computer-Aided Design 55
- Organic Chemistry 327
Countries citing papers authored by Tomaž Pisanski
This map shows the geographic impact of Tomaž Pisanski'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 Tomaž Pisanski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomaž Pisanski more than expected).
Fields of papers citing papers by Tomaž Pisanski
This network shows the impact of papers produced by Tomaž Pisanski. 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 Tomaž Pisanski. The network helps show where Tomaž Pisanski may publish in the future.
Co-authors
The 25 scholars most cited alongside Tomaž Pisanski, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 16 | |
| 2 | 2020 | 5 | |
| 3 | Characterization of generalised Petersen graphs that are Kronecker covers | 2019 | 1 |
| 4 | 2019 | 0 | |
| 5 | 2013 | 1 | |
| 6 | The Dilation Coefficient of Complete Graphs | 2009 | 0 |
| 7 | 2007 | 12 | |
| 8 | 2006 | 14 | |
| 9 | Counting disconnected structures : Chemical trees, fullerenes, I-graphs, and others | 2005 | 7 |
| 10 | On the orientable genus of the cartesian product of a complete regular tripartite graph with an even cycle. | 2004 | 2 |
| 11 | Leapfrog and Related Operations on Toroidal Fullerenes | 2002 | 35 |
| 12 | Growth in products of graphs | 2002 | 1 |
| 13 | The remarkable generalized Petersen graph $G(8,3)$ | 2000 | 9 |
| 14 | NiceGraph Program and its Applications in Chemistry | 1995 | 8 |
| 15 | Automatic clustering of languages | 1992 | 10 |
| 16 | 1989 | 1 | |
| 17 | Orientably simple graphs | 1987 | 20 |
| 18 | 1986 | 25 | |
| 19 | 1-factorisation of the Composition of Regular Graphs | 1983 | 5 |
| 20 | 1981 | 2 |
About Tomaž Pisanski
Tomaž Pisanski is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Physical and Theoretical Chemistry, having authored 149 papers that have together received 1.8k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (45 papers), graph theory and CDMA systems (43 papers), Finite Group Theory Research (40 papers), Graph theory and applications (33 papers), Coding theory and cryptography (19 papers), Graph Labeling and Dimension Problems (18 papers), Limits and Structures in Graph Theory (11 papers) and History and advancements in chemistry (11 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (489 citations), Geometry and Topology (676 citations), Computational Theory and Mathematics (737 citations), Computer Graphics and Computer-Aided Design (55 citations) and Organic Chemistry (327 citations). Tomaž Pisanski has collaborated with scholars based in Slovenia, United States and United Kingdom. Frequent co-authors include Ante Graovac, Bojan Mohar, Milan Randić, Patrick W. Fowler, Marko Boben, Janez Žerovnik, Dragan Marušič, John Shawe‐Taylor, T. D. Parsons and Brigitte Servatius. Their work appears in journals such as Discrete Mathematics, Ars Mathematica Contemporanea, Journal of Graph Theory, European Journal of Combinatorics and The Electronic Journal of Combinatorics.
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.