Daniel Kráľ tschechischer Mathematiker und Informatiker
Kráľ, Daniel, 1978-
Kráľ, Daniel
Král', Daniel, 19..-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
VIAF ID: 100849414 (Personal)
Permalink: http://viaf.org/viaf/100849414
Preferred Forms
-
100 0 _
‡a
Daniel Kráľ
‡c
tschechischer Mathematiker und Informatiker
-
100 1 _ ‡a Král', Daniel
-
100 1 _
‡a
Král', Daniel
-
100 1 _
‡a
Král', Daniel,
‡d
19..-....
-
100 1 _ ‡a Král', Daniel ‡d (1978- ).
-
100 1 _
‡a
Kráľ, Daniel
-
100 1 _
‡a
Kráľ, Daniel
‡d
1978-
-
100 1 _ ‡a Kráľ, Daniel, ‡d 1978-
4xx's: Alternate Name Forms (7)
Works
| Title | Sources |
|---|---|
| 6-Critical Graphs on the Klein Bottle |
|
| Applications of limits of combinatorial structures in geometry and graph theory. |
|
| Compactness and finite forcibility of graphons |
|
| Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings |
|
| Counting flags in triangle-free digraphs |
|
| Cyclic, diagonal and facial colorings—a missing case |
|
| Decomposition Width of Matroids |
|
| Distance constrained labelings of K 4 -minor free graphs |
|
| Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems |
|
| Elusive extremal graphs |
|
| Equipartite polytopes |
|
| Eulerian colorings and the bipartizing matchings conjecture of Fleischner |
|
| An exact algorithm for the channel assignment problem |
|
| Extending partial 5-colorings and 6-colorings in planar graphs |
|
| Extensions of Fractional Precolorings Show Discontinuous Behavior |
|
| FO Model Checking of Interval Graphs |
|
| Forcing generalised quasirandom graphs efficiently |
|
| The fractional chromatic number of triangle-free subcubic graphs |
|
| Fractional total colourings of graphs of high girth |
|
| Fullerene graphs have exponentially many perfect matchings |
|
| Graphs with bounded tree-width and large odd-girth are almost bipartite |
|
| Group coloring is Π 2 P -complete |
|
| Hajós' theorem for list coloring |
|
| Hamilton cycles in prisms |
|
| Hereditary properties of permutations are strongly testable |
|
| It is tough to be a plumber |
|
| Labeling planar graphs with a condition at distance two |
|
| Labelings of Graphs with Fixed and Variable Edge-Weights |
|
| Large permutations and parameter testing |
|
| The last excluded case of Dirac's map-color theorem for choosability |
|
| The Last Fraction of a Fractional Conjecture |
|
| List coloring of Cartesian products of graphs |
|
| List colorings with measurable sets |
|
| Locally consistent constraint satisfaction problems |
|
| Long cycles in fullerene graphs |
|
| Markov bases of binary graph models of K 4 -minor free graphs |
|
| Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming |
|
| Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs |
|
| Min-Max Relations for Odd Cycles in Planar Graphs |
|
| Mixed hypercacti |
|
| Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs |
|
| Monochromatic triangles in three-coloured graphs |
|
| Non-rainbow colorings of 3-, 4- and 5-connected plane graphs |
|
| Non-Three-Colourable Common Graphs Exist |
|
| A note on antisymmetric flows in graphs |
|
| On maximum face-constrained coloring of plane graphs with no short face cycles |
|
| On the removal lemma for linear systems over Abelian groups |
|
| Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs |
|
| Packing six T -joins in plane graphs |
|
| Pancyclicity of Strong Products of Graphs |
|
| Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice |
|
| A problem of Erdős and Sós on 3-graphs |
|
| Procédures de déchargement global pour résoudre des problèmes de coloration dans les graphes. |
|
| Projective, affine, and abelian colorings of cubic graphs |
|
| Quasirandom permutations are characterized by 4-point densities |
|
| Randomized strategies for the plurality problem |
|
| Rank of divisors on tropical curves |
|
| A revival of the girth conjecture |
|
| Short Cycle Covers of Graphs with Minimum Degree Three |
|
| Steinberg's Conjecture is false |
|
| The step Sidorenko property and non-norming edge-transitive graphs |
|
| Surveys in combinatorics 2015 |
|
| Testing first-order properties for subclasses of sparse graphs |
|
| Tough spiders |
|
| Toughness threshold for the existence of 2-walks in K 4 -minor-free graphs |
|
| Triangles in arrangements of points and lines in the plane |
|
| Unions of perfect matchings in cubic graphs |
|
| Weak regularity and finitely forcible graph limits |
|
