Daniel Kráľ

Q: What Schools Are Affiliated With Daniel Kráľ

Daniel Kráľ is affiliated with the following schools: University of Warwick, Charles University, University of West Bohemia, Masaryk University

Daniel Kráľ's AcademicInfluence.com Rankings

Daniel Kráľ

Computer Science

#4293

World Rank

#4518

Historical Rank

computer-science Degrees

Daniel Kráľ

Mathematics

#4098

World Rank

#5894

Historical Rank

Graph Theory

#66

World Rank

#73

Historical Rank

Measure Theory

#3322

World Rank

#3926

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Daniel Kráľ's Degrees

PhD Mathematics Masaryk University

Why Is Daniel Kráľ Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Daniel Kráľ is a Czech mathematician and computer scientist who works as a professor of mathematics and computer science at the Masaryk University. His research primarily concerns graph theory and graph algorithms.

(See a Problem?)

Daniel Kráľ's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Complexity of Coloring Graphs without Forbidden Induced Subgraphs (2001) (203)
On the number of pentagons in triangle-free graphs (2011) (131)
A Theorem about the Channel Assignment Problem (2003) (127)
Testing first-order properties for subclasses of sparse graphs (2011) (106)
Deciding First-Order Properties for Sparse Graphs (2010) (101)
Coloring squares of planar graphs with girth six (2008) (86)
A combinatorial proof of the Removal Lemma for Groups (2008) (70)
A removal lemma for systems of linear equations over finite fields (2008) (67)
Counting flags in triangle-free digraphs (2009) (67)
Quasirandom permutations are characterized by 4-point densities (2012) (64)
Steinberg's Conjecture is false (2016) (60)
Non-Three-Colourable Common Graphs Exist (2011) (60)
A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points (2011) (58)
Rank of divisors on tropical curves (2007) (56)
Exponentially many perfect matchings in cubic graphs (2010) (54)
Coloring Powers of Chordal Graphs (2005) (49)
A problem of Erdős and Sós on 3-graphs (2013) (48)
Fullerene graphs have exponentially many perfect matchings (2008) (46)
Finitely forcible graphons and permutons (2013) (43)
Monochromatic triangles in three-coloured graphs (2012) (43)
Coloring plane graphs with independent crossings (2008) (43)
Graph labellings with variable weights, a survey (2009) (41)
On Feasible Sets of Mixed Hypergraphs (2004) (41)
Classes of graphs with small rank decompositions are X-bounded (2011) (37)
Edge-disjoint odd cycles in planar graphs (2004) (34)
The Channel Assignment Problem with Variable Weights (2006) (34)
Brooks' Theorem via the Alon-Tarsi Theorem (2010) (33)
Permutations with fixed pattern densities (2015) (32)
Coloring Mixed Hypertrees (2000) (32)
An exact algorithm for the channel assignment problem (2005) (29)
FO Model Checking of Interval Graphs (2013) (28)
Two algorithms for general list matrix partitions (2005) (27)
Hamilton cycles in prisms (2007) (27)
A New Bound for the 2/3 Conjecture† (2012) (27)
Unions of perfect matchings in cubic graphs (2005) (27)
A note on group colorings (2005) (25)
A bound on the inducibility of cycles (2018) (24)
Mixed hypergraphs and other coloring problems (2007) (24)
Labeling planar graphs with a condition at distance two (2007) (23)
Cyclic, diagonal and facial colorings (2005) (22)
Coloring planar graphs with triangles far apart (2009) (22)
Coloring Triangle-Free Graphs on Surfaces (2007) (22)
Colorings Of Plane Graphs With No Rainbow Faces (2006) (21)
On Planar Mixed Hypergraphs (2001) (21)
Projective, affine, and abelian colorings of cubic graphs (2009) (21)
Packing six T-joins in plane graphs (2010) (20)
Short Cycle Covers of Graphs with Minimum Degree Three (2009) (20)
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations (2015) (19)
A revival of the girth conjecture (2004) (19)
On the removal lemma for linear systems over Abelian groups (2011) (18)
Coloring face hypergraphs on surfaces (2005) (18)
The Circular Chromatic Index of Flower Snarks (2006) (18)
6-Critical Graphs on the Klein Bottle (2008) (17)
Mixed hypercacti (2004) (17)
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs (2009) (17)
Randomized strategies for the plurality problem (2008) (17)
A counter-example to Voloshin's hypergraph co-perfectness conjecture (2003) (16)
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs (2003) (16)
Packing directed cycles through a specified vertex set (2013) (15)
Fractional colorings of cubic graphs with large girth (2010) (15)
A Brooks-Type Theorem for the Generalized List T-Coloring (2005) (14)
Tough spiders (2007) (14)
Characterization of quasirandom permutations by a pattern sum (2019) (14)
Hereditary properties of permutations are strongly testable (2012) (13)
On maximum face-constrained coloring of plane graphs with no short face cycles (2004) (13)
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs (2004) (13)
Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs (2011) (13)
Coloring squares of planar graphs with no short cycles (2005) (13)
Algorithms for Classes of Graphs with Bounded Expansion (2009) (12)
Markov bases of binary graph models of K4-minor free graphs (2008) (12)
Decomposing Graphs into Edges and Triangles (2017) (12)
Finitely forcible graph limits are universal (2017) (12)
Locally satisfiable formulas (2004) (12)
Distance constrained labelings of planar graphs with no short cycles (2009) (12)
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice (2008) (12)
The step Sidorenko property and non-norming edge-transitive graphs (2018) (12)
List coloring of Cartesian products of graphs (2006) (12)
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies (2009) (12)
The circular chromatic index of graphs of high girth (2007) (12)
Coloring graphs from lists with bounded size of their union (2005) (11)
Characterization of affine Steiner triple systems and Hall triple systems (2007) (11)
No additional tournaments are quasirandom-forcing (2019) (11)
Three Optimal Algorithms for Balls of Three Colors (2005) (11)
Short Cycle Covers of Cubic Graphs (11)
Weak regularity and finitely forcible graph limits (2015) (11)
Upper hamiltonian numbers and hamiltonian spectra of graphs (2006) (11)
Min-Max Relations for Odd Cycles in Planar Graphs (2011) (11)
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five (2014) (11)
Probabilistic strategies for the partition and plurality problems (2007) (11)
Hajós' theorem for list coloring (2004) (10)
Facial colorings using Hall's Theorem (2010) (10)
Domination number of cubic graphs with large girth (2009) (10)
Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs (2010) (10)
First order convergence of matroids (2015) (10)
Fe2MnSn – Experimental quest for predicted Heusler alloy (2020) (10)
Circular edge-colorings of cubic graphs with girth six (2009) (10)
Fractional total colourings of graphs of high girth (2009) (9)
Cyclic, diagonal and facial colorings - a missing case (2007) (9)
Densities in large permutations and parameter testing (2014) (9)
Hamilton cycles in prisms over graphs (2005) (9)
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs (2010) (9)
Coloring even-faced graphs in the torus and the Klein bottle (2008) (9)
The fractional chromatic number of triangle-free subcubic graphs (2012) (8)
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk (2013) (8)
Group coloring and list group coloring are ΠP2-Complete (2004) (8)
The Last Fraction of a Fractional Conjecture (2009) (8)
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings (2006) (8)
Third Case of the Cyclic Coloring Conjecture (2015) (8)
Infinite‐dimensional finitely forcible graphon (2014) (8)
Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract) (2004) (8)
Recovering Sparse Graphs (2017) (8)
Long cycles in fullerene graphs (2008) (8)
Decomposition Width of Matroids (2010) (8)
First order limits of sparse graphs: Plane trees and path‐width (2015) (7)
Computing Representations of Matroids of Bounded Branch-Width (2007) (7)
Quasirandom Latin squares (2020) (7)
Cyclic colorings of plane graphs with independent faces (2008) (7)
On Intersection Graphs of Segments with Prescribed Slopes (2001) (7)
On Complexity of Colouring Mixed Hypertrees (2001) (7)
Non‐rainbow colorings of 3‐, 4‐ and 5‐connected plane graphs (2010) (7)
An improved linear bound on the number of perfect matchings in cubic graphs (2009) (7)
Compactness and finite forcibility of graphons (2013) (6)
Non-Bipartite K-Common Graphs (2020) (6)
It is tough to be a plumber (2004) (6)
Magnetic and Magneto-Optical Properties of Fe75−xMn25Gax Heusler-like Compounds (2020) (6)
Elusive extremal graphs (2018) (6)
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (2009) (6)
Cycles of length three and four in tournaments (2019) (6)
Toward characterizing locally common graphs (2020) (6)
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle (2010) (6)
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (2014) (6)
Hamilton cycles in strong products of graphs (2005) (6)
The last excluded case of Dirac's map‐color theorem for choosability (2006) (6)
Closure for the property of having a hamiltonian prism (2007) (6)
Graphic TSP in Cubic Graphs (2016) (6)
Deciding First Order Properties of Matroids (2012) (6)
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (2010) (6)
A variational principle for permutations (2015) (6)
Common graphs with arbitrary chromatic number (2022) (6)
Toughness threshold for the existence of 2-walks in K4-minor-free graphs (2010) (5)
Labelings of Graphs with Fixed and Variable Edge-Weights (2007) (5)
Group Coloring and List Group Coloring Are (2004) (5)
Coloring Eulerian Triangulations of the Klein Bottle (2012) (5)
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming (2019) (5)
A simple model for the electrochemical oscillations on a stationary mercury electrode in bromate solutions (1992) (5)
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm (2016) (5)
A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km (2009) (5)
Cyclic coloring of plane graphs with maximum face size 16 and 17 (2016) (5)
The last excluded case of Dirac's map-color theorem for choosability (2006) (5)
On the number of intersections of two polygons (2003) (4)
Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs (2007) (4)
Complexity Note on Mixed Hypergraphs (2001) (4)
Group coloring is P 2-complete (2005) (4)
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract) (2004) (4)
Pattern Hypergraphs (2010) (4)
Simple sparse matrix multiplication algorithm (1995) (3)
Cycles of a given length in tournaments (2020) (3)
Densities of 3-vertex graphs (2016) (3)
Distance constrained labelings of K4 -minor free graphs (2009) (3)
Decomposition width - a new width parameter for matroids (2009) (3)
Triangles in arrangements of points and lines in the plane (2011) (3)
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems (2007) (3)
Cubic bridgeless graphs have more than a linear number of perfect matchings (2009) (3)
Slovakia’s general election: the impact of the refugee crisis is likely to push Robert Fico back to power (2016) (3)
Deciding first order logic properties of matroids (2011) (3)
Locally Consistent Constraint Satisfaction Problems with Binary Constraints (2005) (3)
Hamiltonian threshold for strong products of graphs (2008) (3)
Equipartite graphs (2008) (3)
Extending Fractional Precolorings (2012) (3)
Locally consistent constraint satisfaction problems (2005) (3)
Large permutations and parameter testing (2014) (3)
Planar graph with twin-width seven (2022) (3)
Pancyclicity of Strong Products of Graphs (2004) (3)
A row-invariant parameterized algorithm for integer programming (2019) (3)
Finite forcibility and computability of graph limits (2017) (2)
Despite a controversial referendum on same-sex marriage, democracy remains alive and well in Slovakia (2015) (2)
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization (2000) (2)
Matchings and Nonrainbow Colorings (2008) (2)
Optical and magneto-optical properties of Heusler compounds (2017) (2)
Coloring of Triangle-Free Graphs on the Double Torus (2008) (2)
Inducibility and universality for trees (2021) (2)
Surveys in Combinatorics 2015 (2015) (2)
A note on antisymmetric flows in graphs (2010) (2)
An application of flag algebras to a problem of Erdős and Sós (2013) (2)
Minimum Degree and the Number of Chords (2003) (2)
List colorings with measurable sets (2008) (2)
Using Kerr Microscopy for Direct Observation of Magnetic Domains in Ni–Mn–Ga Magnetic Shape Memory Alloy (2017) (2)
Hypergraphs with Minimum Positive Uniform Turán Density (2021) (2)
Optimal Free Binary Decision Diagrams for Computation of EARn (2002) (2)
Eulerian colorings and the bipartizing matchings conjecture of Fleischner (2006) (2)
Person : more non-bipartite forcing pairs (2019) (1)
Chromatic Number for a Generalization of Cartesian Product Graphs (2009) (1)
Although Robert Fico is the clear favourite in the Slovakian presidential elections, the real story may be the rise of political ‘outsider’ Andrej Kiska (2014) (1)
Graphic TSP in 2-connected cubic graphs (2016) (1)
Slovakia’s election: a party system entering uncharted waters (2016) (1)
Extending partial 5-colorings and 6-colorings in planar graphs (2006) (1)
The Political Economy of Crisis Adjustment in Central and Eastern Europe (2014) (1)
Free binary decision diagrams for the computation of EARn (2006) (1)
Hamilton cycles in strong products of graphs: HAMILTON CYCLES IN STRONG PRODUCTS (2005) (1)
Six-Critical Graphs on the Klein Bottle (2008) (1)
Complexity of Pattern Coloring of Cycle Systems (2002) (1)
Matchings and non-rainbow colorings (1)
More non-bipartite forcing pairs (2019) (1)
Group coloring is π2P-complete (2005) (1)
Finitely forcible graphons with an almost arbitrary structure (2018) (1)
On Maximum Face-Constrained Coloring of Plane Graphs of Girth at least 5 (2002) (1)
Graphs with bounded tree-width and large odd-girth are almost bipartite (2009) (1)
Counting flags in triangle-free digraphs (2016) (1)
Coloring triangle-free graphs on surfaces . Extended abstract . ∗ (2007) (1)
A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points (2012) (1)
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems (2005) (1)
Extremal graph theory and finite forcibility (2017) (0)
A removal lemma for systems of linear equations over finite fields (2012) (0)
Equipartite polytopes (2010) (0)
Deobfuscating sparse graphs (2017) (0)
Extensions of Fractional Precolorings Show Discontinuous Behavior (2012) (0)
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) (2021) (0)
Graph Theory (2020) (0)
Forcing Generalized Quasirandom Graphs Efficiently (2023) (0)
A problem of Erdős and Sós on 3-graphs (2015) (0)
Coloring Eulerian Triangulations of the Klein Bottle (2011) (0)
Choosability of Squares of K4-minor Free Graphs (2008) (0)
] 3 J ul 2 01 8 Elusive extremal graphs (2018) (0)
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (2022) (0)
C O ] 4 A ug 2 01 8 A bound on the inducibility of cycles (2018) (0)
On the number of solutions of regular systems in sets with positive density in abelian groups (2010) (0)
Non-Bipartite K-Common Graphs (2022) (0)
Limit Behavior of Locally Consistent Constraint Satisfaction Problems (2011) (0)
Density Maximizers of Layered Permutations (2021) (0)
Equipartite polytopes and graphs (2004) (0)
There is more to the Eurozone than the division between ‘North’ and ‘South’ (2015) (0)
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (2020) (0)
D ec 2 01 9 No additional tournaments are quasirandom-forcing ∗ (2019) (0)
Reflections on Psalm 46:10a (2014) (0)
Diplomov´a Pr´ace Szemerédi Regularity Lemma a Jeho Aplikace V Kombinatorice – (szemerédi Regularity Lemma and Its Applications in Combinatorics) Title: Szemerédi Regularity Lemma and Its Applications in Combinatorics (2008) (0)
Determination of L21 versus B2 phase content in Heusler alloys Ni2MnGa and Co2FeGe0.5Ga0.5 with X-ray diffraction (2018) (0)
LIPIcs, Volume 170, MFCS 2020, Complete Volume (2020) (0)
C O ] 6 J un 2 01 8 Decomposing graphs into edges and triangles ∗ (2018) (0)
Borodin's conjecture on diagonal coloring is false (2004) (0)
Determination of Strontium Incorporation in Bone (2011) (0)
Political outsider Andrej Kiska is the new Slovak president, but it remains to be seen what he really stands for (2014) (0)
Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice (2009) (0)
Coloring graphs by translates in the circle (2020) (0)
Optimal‐size clique transversals in chordal graphs (2016) (0)
Packing and covering directed triangles asymptotically (2019) (0)
First-Order Convergence and Roots † (2014) (0)
Deciding Properties in Sparse Combinatorial Structures (2012) (0)
Free Binary Decision Diagrams for Computation of EAR n (2003) (0)
Distance constrained labelings of K4-minor free graphs (2007) (0)

This paper list is powered by the following services:

Other Resources About Daniel Kráľ

What Schools Are Affiliated With Daniel Kráľ?

Daniel Kráľ is affiliated with the following schools:

Daniel Kráľ's Academic­Influence.com Rankings

Daniel Kráľ's Degrees

Why Is Daniel Kráľ Influential?

Daniel Kráľ's Published Works

Published Works

Other Resources About Daniel Kráľ

What Schools Are Affiliated With Daniel Kráľ?

Daniel Kráľ's AcademicInfluence.com Rankings