Ladislav Stacho
- Computational Theory and Mathematics top 5%
- Molecular Biology
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 10%
- Electrical and Electronic Engineering
- Co-authors
- Ján MaňuchArvind GuptaDaniel Král͏̌Steven PelechPavol HellMikael HammarLuisa GarganoUgo Vaccaro
- Topics
- Advanced Graph Theory Research (34 papers)Limits and Structures in Graph Theory (20 papers)Graph Labeling and Dimension Problems (13 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- CanadaSlovakiaUnited States
In The Last Decade
Ladislav Stacho
63 papers receiving 330 citations
Peers
Comparison fields: 5 of 70
- Computational Theory and Mathematics 170
- Molecular Biology 142
- Computer Networks and Communications 64
- Discrete Mathematics and Combinatorics 51
- Electrical and Electronic Engineering 47
Countries citing papers authored by Ladislav Stacho
This map shows the geographic impact of Ladislav Stacho'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 Ladislav Stacho with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ladislav Stacho more than expected).
Fields of papers citing papers by Ladislav Stacho
This network shows the impact of papers produced by Ladislav Stacho. 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 Ladislav Stacho. The network helps show where Ladislav Stacho may publish in the future.
Co-authorship network of co-authors of Ladislav Stacho
This figure shows the co-authorship network connecting the top 25 collaborators of Ladislav Stacho. A scholar is included among the top collaborators of Ladislav Stacho 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 Ladislav Stacho. Ladislav Stacho is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 3 | |
| 3 | 2 | |
| 4 | 5 | |
| 5 | 61 | |
| 6 | 1 | |
| 7 | 4 | |
| 8 | 1 | |
| 9 | 4 | |
| 10 | 8 | |
| 11 | 3 | |
| 12 | 31 | |
| 13 | 1 | |
| 14 | A NOTE ON UPPER BOUND FOR CHROMATIC NUMBER OF A GRAPH | 1 |
| 15 | Cycles through specified vertices in 1-tough graphs. | 4 |
| 16 | 4 | |
| 17 | 6 | |
| 18 | Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. | 2 |
| 19 | 9 | |
| 20 | On minimal outerplanar graphs of given diameter. | 1 |
About Ladislav Stacho
Ladislav Stacho is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics, having authored 67 papers that have together received 348 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (34 papers), Limits and Structures in Graph Theory (20 papers) and Graph Labeling and Dimension Problems (13 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (51 citations), Computational Theory and Mathematics (170 citations) and Computer Graphics and Computer-Aided Design (28 citations). Ladislav Stacho has collaborated with scholars based in Canada, Slovakia and United States. Frequent co-authors include Ján Maňuch, Arvind Gupta, Daniel Král͏̌, Steven Pelech, Pavol Hell, Mikael Hammar, Luisa Gargano, Ugo Vaccaro, Imrich Vrt’o and Evangelos Kranakis. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Networks.
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.