Daniel Král͏̌
-
- Limits and Structures in Graph Theory 77
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 121
- Graph Labeling and Dimension Problems 53
- Complexity and Algorithms in Graphs 16
- Geometry and Topology top 2%
- Graph theory and applications 21
- Advanced Topology and Set Theory 7
-
- Computational Geometry and Mesh Generation 19
-
- graph theory and CDMA systems 44
- Co-authors
- Riste ŠkrekovskiZdenĕk DvořákRobin ThomasSerguei NorineJan HladkýOriol SerraHeinz‐Jürgen VossLadislav Stacho
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- SIAM Journal on Discrete Mathematics (18 papers)European Journal of Combinatorics (18 papers)Journal of Combinatorial Theory Series B (11 papers)
- Partner nations
- CzechiaUnited KingdomUnited States
In The Last Decade
Daniel Král͏̌
136 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 59
- Discrete Mathematics and Combinatorics 628
- Computational Theory and Mathematics 1.1k
- Geometry and Topology 314
- Computer Graphics and Computer-Aided Design 108
- Electrical and Electronic Engineering 366
Countries citing papers authored by Daniel Král͏̌
This map shows the geographic impact of Daniel Král͏̌'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 Daniel Král͏̌ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Král͏̌ more than expected).
Fields of papers citing papers by Daniel Král͏̌
This network shows the impact of papers produced by Daniel Král͏̌. 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 Daniel Král͏̌. The network helps show where Daniel Král͏̌ may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Daniel Král͏̌, 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 | 2023 | 3 | |
| 2 | 2023 | 0 | |
| 3 | 2022 | 0 | |
| 4 | 2018 | 1 | |
| 5 | Finite forcibility and computability of graph limits | 2017 | 1 |
| 6 | 2015 | 3 | |
| 7 | A new lower bound based on Gromov’s method of selecting heavily covered points | 2011 | 22 |
| 8 | 2011 | 4 | |
| 9 | 2010 | 1 | |
| 10 | 2010 | 21 | |
| 11 | 2009 | 11 | |
| 12 | Coloring planar graphs with triangles far apart | 2009 | 14 |
| 13 | 2008 | 20 | |
| 14 | 2005 | 14 | |
| 15 | Locally consistent constraint satisfaction problems: (Extended abstract) | 2004 | 1 |
| 16 | Group Coloring and List Group Coloring Are Pi 2 P-Complete (Extended Abstract). | 2004 | 1 |
| 17 | 2004 | 4 | |
| 18 | Minimum Degree and the Number of Chords. | 2003 | 1 |
| 19 | A counter-example to Voloshin's hypergraph co-perfectness conjecture. | 2003 | 9 |
| 20 | 2003 | 2 |
About Daniel Král͏̌
Daniel Král͏̌ is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computational Mathematics, having authored 149 papers that have together received 1.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (121 papers), Limits and Structures in Graph Theory (77 papers), Graph Labeling and Dimension Problems (53 papers), graph theory and CDMA systems (44 papers), Graph theory and applications (21 papers), Computational Geometry and Mesh Generation (19 papers), Complexity and Algorithms in Graphs (16 papers) and Advanced Topology and Set Theory (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (628 citations), Computational Theory and Mathematics (1.1k citations), Geometry and Topology (314 citations), Computer Graphics and Computer-Aided Design (108 citations) and Electrical and Electronic Engineering (366 citations). Daniel Král͏̌ has collaborated with scholars based in Czechia, United Kingdom and United States. Frequent co-authors include Riste Škrekovski, Zdenĕk Dvořák, Robin Thomas, Serguei Norine, Jan Hladký, Oriol Serra, Heinz‐Jürgen Voss, Ladislav Stacho, František Kardoš and Jean‐Sébastien Sereni. Their work appears in journals such as SIAM Journal on Discrete Mathematics, European Journal of Combinatorics, Journal of Combinatorial Theory Series B, Journal of Graph Theory and Discrete Mathematics.
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.