Bohdan Zelinka
- Computational Theory and Mathematics top 0.5%
- Geometry and Topology top 2%
- Discrete Mathematics and Combinatorics top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Co-authors
- Ivan ChajdaLutz VolkmannRobert L. HemmingerZdeněk RyjáčekPreben Dahl VestergaardJuhani NieminenAnton KotzigV. Veselý
- Topics
- Advanced Graph Theory Research (105 papers)Graph theory and applications (80 papers)Graph Labeling and Dimension Problems (78 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- CzechiaUnited StatesGermany
In The Last Decade
Bohdan Zelinka
104 papers receiving 645 citations
Peers
Comparison fields: 5 of 57
- Computational Theory and Mathematics 638
- Geometry and Topology 241
- Discrete Mathematics and Combinatorics 146
- Computer Networks and Communications 108
- Electrical and Electronic Engineering 70
Countries citing papers authored by Bohdan Zelinka
This map shows the geographic impact of Bohdan Zelinka'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 Bohdan Zelinka with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bohdan Zelinka more than expected).
Fields of papers citing papers by Bohdan Zelinka
This network shows the impact of papers produced by Bohdan Zelinka. 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 Bohdan Zelinka. The network helps show where Bohdan Zelinka may publish in the future.
Co-authorship network of co-authors of Bohdan Zelinka
This figure shows the co-authorship network connecting the top 25 collaborators of Bohdan Zelinka. A scholar is included among the top collaborators of Bohdan Zelinka 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 Bohdan Zelinka. Bohdan Zelinka is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | On a problem concerning stratified graphs | 25 |
| 2 | Every connected acyclic digraph of height 1 is neighbourhood-realizable | 0 |
| 3 | Edge-domatically full graphs | 0 |
| 4 | Total domatic number and degrees of vertices of a graph | 25 |
| 5 | Polytopic locally linear graphs | 2 |
| 6 | Domatic numbers of uniform hypergraphs | 2 |
| 7 | Semidomatic numbers of directed graphs | 4 |
| 8 | Domatic number and degrees of vertices of a graph | 15 |
| 9 | Domatic numbers of cube graphs | 8 |
| 10 | Decomposition of a complete equipartite graph into isomorphic subgraphs | 0 |
| 11 | The lattice of all subtrees of a tree | 1 |
| 12 | Hadwiger numbers of finite graphs | 4 |
| 13 | Finite Vertex-Transitive Planar Graphs of the Regularity Degree Four or Five | 0 |
| 14 | Intersection Graphs of Graphs | 1 |
| 15 | Determining the maximal degree of a tree given by its distance matrix. | 0 |
| 16 | Intersection Graphs of Lattices | 3 |
| 17 | Finding a spanning tree of a graph with maximal number of terminal vertices. | 2 |
| 18 | Quasigroups and Factorisation of Complete Digraphs | 1 |
| 19 | Reconstructing a Graph from the Incidence Relation on its Edge Set | 0 |
| 20 | The Decomposition of a General Graph according to a Given Abelian Group | 0 |
About Bohdan Zelinka
Bohdan Zelinka is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 199 papers that have together received 829 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (105 papers), Graph theory and applications (80 papers) and Graph Labeling and Dimension Problems (78 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (146 citations), Computational Theory and Mathematics (638 citations) and Geometry and Topology (241 citations). Bohdan Zelinka has collaborated with scholars based in Czechia, United States and Germany. Frequent co-authors include Ivan Chajda, Lutz Volkmann, Robert L. Hemminger, Zdeněk Ryjáček, Preben Dahl Vestergaard, Juhani Nieminen, Anton Kotzig, V. Veselý and Ivan M. Havel. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of the London Mathematical Society.
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.