Klas Markström
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 33
-
- Limits and Structures in Graph Theory 33
- Co-authors
- P. H. Lundow (12 shared papers)Allan Lo (6 shared papers)Andrzej Ruciński (1 shared paper)Daniel Andrén (6 shared papers)Anders Rosengren (4 shared papers)Shmuel Friedland (6 shared papers)Roland Häggkvist (5 shared papers)Anders Behndig (2 shared papers)
- Journals
- Discrete Mathematics (6 papers)Random Structures and Algorithms (5 papers)Combinatorics Probability Computing (4 papers)The Electronic Journal of Combinatorics (4 papers)Nuclear Physics B (4 papers)
- Partner nations
- SwedenUnited KingdomUnited States
In The Last Decade
Klas Markström
67 papers receiving 657 citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 260
- Computational Theory and Mathematics 309
- Geometry and Topology 141
- Condensed Matter Physics 174
- Mathematical Physics 115
Countries citing papers authored by Klas Markström
This map shows the geographic impact of Klas Markström'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 Klas Markström with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klas Markström more than expected).
Fields of papers citing papers by Klas Markström
This network shows the impact of papers produced by Klas Markström. 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 Klas Markström. The network helps show where Klas Markström may publish in the future.
Co-authors
The 25 scholars most cited alongside Klas Markström, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 73 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 45 | |
| 2 | 2011 | 43 | |
| 3 | 2014 | 43 | |
| 4 | 2010 | 42 | |
| 5 | Generation and properties of snarks | 2016 | 39 |
| 6 | 2007 | 27 | |
| 7 | 2009 | 26 | |
| 8 | 2010 | 23 | |
| 9 | 2005 | 22 | |
| 10 | 2008 | 21 | |
| 11 | 2007 | 20 | |
| 12 | 2014 | 20 | |
| 13 | 2012 | 19 | |
| 14 | 2013 | 18 | |
| 15 | 2008 | 15 | |
| 16 | 2015 | 14 | |
| 17 | 2009 | 13 | |
| 18 | 2004 | 13 | |
| 19 | 2006 | 13 | |
| 20 | 2011 | 12 |
About Klas Markström
Klas Markström is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics and Electrical and Electronic Engineering, having authored 73 papers that have together received 701 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (33 papers), Limits and Structures in Graph Theory (33 papers), Graph theory and applications (16 papers), graph theory and CDMA systems (15 papers), Stochastic processes and statistical mechanics (12 papers), Theoretical and Computational Physics (12 papers), Markov Chains and Monte Carlo Methods (8 papers) and Advanced Topology and Set Theory (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (260 citations), Computational Theory and Mathematics (309 citations), Geometry and Topology (141 citations), Condensed Matter Physics (174 citations) and Mathematical Physics (115 citations). Klas Markström has collaborated with scholars based in Sweden, United Kingdom and United States. Frequent co-authors include P. H. Lundow, Allan Lo, Andrzej Ruciński, Daniel Andrén, Anders Rosengren, Shmuel Friedland, Roland Häggkvist, Anders Behndig, Jan Goedgebeur and Gunnar Brinkmann. Their work appears in journals such as Discrete Mathematics, Random Structures and Algorithms, Combinatorics Probability Computing, The Electronic Journal of Combinatorics and Nuclear Physics B.
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.