Daniel Král'

From MaRDI portal
Person:273100

Available identifiers

zbMath Open kral.danielWikidataQ21062080 ScholiaQ21062080MaRDI QIDQ273100

List of research outcomes

PublicationDate of PublicationType
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations2024-01-29Paper
Quasirandom-Forcing Orientations of Cycles2023-11-29Paper
Closure property of contraction-depth of matroids2023-11-03Paper
The dimension of the region of feasible tournament profiles2023-10-30Paper
Quasirandom Latin squares2023-10-17Paper
Toward characterizing locally common graphs2023-10-17Paper
Uniform Turán density of cycles2023-07-10Paper
Forcing Generalized Quasirandom Graphs Efficiently2023-03-07Paper
No additional tournaments are quasirandom-forcing2022-12-01Paper
Cycles of a given length in tournaments2022-11-23Paper
Inducibility and universality for trees2022-11-23Paper
Density maximizers of layered permutations2022-10-06Paper
Planar graph with twin-width seven2022-09-23Paper
Non-bipartite \(k\)-common graphs2022-06-30Paper
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming2022-06-08Paper
Packing and covering directed triangles asymptotically2022-01-13Paper
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm2021-11-17Paper
https://portal.mardi4nfdi.de/entity/Q50051292021-08-04Paper
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs2021-07-06Paper
Coloring graphs by translates in the circle2021-06-18Paper
Elusive extremal graphs2021-05-10Paper
Cyclic coloring of plane graphs with maximum face size 16 and 172021-04-14Paper
Analytic representations of large graphs2021-02-06Paper
Characterization of quasirandom permutations by a pattern sum2021-01-05Paper
Finitely forcible graphons with an almost arbitrary structure2020-10-20Paper
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five2020-09-24Paper
Cycles of length three and four in tournaments2020-07-03Paper
Permutations with fixed pattern densities2020-06-19Paper
Non-bipartite k-common graphs2020-06-16Paper
Hadwiger meets Cayley2020-05-12Paper
Decomposing Graphs into Edges and Triangles2020-04-06Paper
Compactness and finite forcibility of graphons2019-10-15Paper
Hereditary properties of permutations are strongly testable2019-06-20Paper
More non-bipartite forcing pairs2019-06-10Paper
Packing directed cycles through a specified vertex set2019-05-15Paper
Infinite‐dimensional finitely forcible graphon2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338182019-05-06Paper
Optimal‐size clique transversals in chordal graphs2019-01-03Paper
The step Sidorenko property and non-norming edge-transitive graphs2018-12-19Paper
A bound on the inducibility of cycles2018-11-08Paper
Finitely forcible graph limits are universal2018-11-08Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk2018-07-24Paper
Graphic TSP in cubic graphs2018-04-19Paper
Walk entropy and walk-regularity2018-04-12Paper
Weak regularity and finitely forcible graph limits2018-03-28Paper
Counting flags in triangle-free digraphs2018-03-16Paper
Extremal graph theory and finite forcibility2018-01-18Paper
First-Order Convergence and Roots2017-10-10Paper
Recovering sparse graphs2017-09-28Paper
First order limits of sparse graphs: Plane trees and path-width2017-08-10Paper
Steinberg's conjecture is false2016-11-25Paper
Densities in large permutations and parameter testing2016-11-07Paper
Third case of the cyclic coloring conjecture2016-10-14Paper
Weak regularity and finitely forcible graph limits2016-10-14Paper
First order convergence of matroids2016-10-12Paper
Densities of 3-vertex graphs2016-10-07Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.2016-06-03Paper
A problem of Erdős and Sós on 3-graphs2016-04-21Paper
Third Case of the Cyclic Coloring Conjecture2016-04-04Paper
FO Model Checking of Interval Graphs2016-01-07Paper
Packing six \(T\)-joins in plane graphs2015-12-11Paper
https://portal.mardi4nfdi.de/entity/Q55012752015-08-03Paper
Rank of divisors on tropical curves2015-06-19Paper
Finitely forcible graphons and permutons2014-11-21Paper
Extensions of fractional precolorings show discontinuous behavior2014-11-17Paper
https://portal.mardi4nfdi.de/entity/Q29217522014-10-13Paper
The fractional chromatic number of triangle-free subcubic graphs2014-07-29Paper
A problem of Erdős and Sós on 3-graphs2014-06-11Paper
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs2014-04-25Paper
Testing first-order properties for subclasses of sparse graphs2014-02-17Paper
Cubic bridgeless graphs have more than a linear number of perfect matchings2013-10-10Paper
Circular edge-colorings of cubic graphs with girth six2013-10-10Paper
Counting flags in triangle-free digraphs2013-10-10Paper
FO Model Checking of Interval Graphs2013-08-07Paper
Six-Critical Graphs on the Klein Bottle2013-06-28Paper
Quasirandom permutations are characterized by 4-point densities2013-06-25Paper
A New Bound for the 2/3 Conjecture2013-05-13Paper
On the number of pentagons in triangle-free graphs2013-03-06Paper
Min-Max Relations for Odd Cycles in Planar Graphs2013-01-04Paper
Coloring Eulerian triangulations of the Klein bottle2012-12-27Paper
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs2012-12-14Paper
On the removal lemma for linear systems over abelian groups2012-12-03Paper
A removal lemma for systems of linear equations over finite fields2012-11-19Paper
Deciding First Order Properties of Matroids2012-11-01Paper
A new lower bound based on Gromov's method of selecting heavily covered points2012-09-19Paper
Extending Fractional Precolorings2012-09-12Paper
Non-Three-Colourable Common Graphs Exist2012-09-12Paper
Decomposition width of matroids2012-05-11Paper
Classes of graphs with small rank decompositions are \(\chi \)-bounded2012-05-04Paper
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs2012-05-04Paper
Fractional colorings of cubic graphs with large girth2012-03-15Paper
Cyclic colorings of plane graphs with independent faces2012-02-11Paper
Domination number of cubic graphs with large girth2012-02-08Paper
Fractional total colourings of graphs of high girth2011-12-08Paper
Limit Behavior of Locally Consistent Constraint Satisfaction Problems2011-10-27Paper
Exponentially many perfect matchings in cubic graphs2011-07-25Paper
The Last Fraction of a Fractional Conjecture2011-04-15Paper
Triangles in arrangements of points and lines in the plane2011-04-11Paper
Short Cycle Covers of Graphs with Minimum Degree Three2011-03-15Paper
Equipartite polytopes2010-12-06Paper
Coloring plane graphs with independent crossings2010-11-10Paper
Graphs with bounded tree-width and large odd-girth are almost bipartite2010-11-05Paper
Brooks' theorem via the Alon-Tarsi theorem2010-10-28Paper
Decomposition Width of Matroids2010-09-07Paper
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs2010-08-27Paper
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs2010-08-27Paper
Markov bases of binary graph models of \(K_{4}\)-minor free graphs2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35766572010-07-30Paper
An improved linear bound on the number of perfect matchings in cubic graphs2010-06-17Paper
Circular edge-colorings of cubic graphs with girth six2010-06-03Paper
Distance constrained labelings of planar graphs with no short cycles2010-04-28Paper
Graph labellings with variable weights, a survey2010-04-28Paper
Facial colorings using Hall's theorem2010-04-27Paper
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs2010-04-22Paper
Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs2010-03-31Paper
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs2010-03-29Paper
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)2010-03-26Paper
Chromatic number for a generalization of Cartesian product graphs2010-03-26Paper
Pattern hypergraphs2010-03-26Paper
Matchings and Nonrainbow Colorings2010-03-17Paper
6-Critical Graphs on the Klein Bottle2010-03-17Paper
Algorithms for Classes of Graphs with Bounded Expansion2010-01-21Paper
Distance constrained labelings of \(K_{4}\)-minor free graphs2009-12-15Paper
A note on antisymmetric flows in graphs2009-12-01Paper
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice2009-11-27Paper
Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice2009-09-18Paper
Fullerene graphs have exponentially many perfect matchings2009-09-02Paper
Long cycles in fullerene graphs2009-09-02Paper
A combinatorial proof of the removal lemma for groups2009-06-17Paper
Hamiltonian threshold for strong products of graphs2009-06-04Paper
Coloring of Triangle-Free Graphs on the Double Torus2009-05-27Paper
Randomized strategies for the plurality problem2009-03-04Paper
List colorings with measurable sets2009-02-20Paper
Equipartite graphs2009-02-17Paper
Projective, affine, and abelian colorings of cubic graphs2009-01-27Paper
Coloring even-faced graphs in the torus and the Klein bottle2008-10-21Paper
Labelings of Graphs with Fixed and Variable Edge-Weights2008-08-13Paper
Characterization of affine Steiner triple systems and Hall triple systems2008-06-05Paper
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems2008-06-05Paper
Coloring Triangle-Free Graphs on Surfaces2008-05-27Paper
Coloring squares of planar graphs with girth six2008-05-13Paper
Tough spiders2008-01-04Paper
Hamilton cycles in prisms2008-01-04Paper
Labeling planar graphs with a condition at distance two2007-11-21Paper
The Channel Assignment Problem with Variable Weights2007-09-06Paper
Computing Representations of Matroids of Bounded Branch-Width2007-09-03Paper
Cyclic, diagonal and facial colorings -- a missing case2007-07-27Paper
Unions of perfect matchings in cubic graphs2007-05-29Paper
Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs2007-05-29Paper
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings2007-05-22Paper
Closure for the property of having a hamiltonian prism2007-03-20Paper
The circular chromatic index of flower snarks2007-03-12Paper
https://portal.mardi4nfdi.de/entity/Q34248842007-03-05Paper
Mixed hypergraphs and other coloring problems2007-03-02Paper
Probabilistic strategies for the partition and plurality problems2007-02-07Paper
The circular chromatic index of graphs of high girth2007-01-11Paper
Colorings of planar graphs with no rainbow faces2007-01-08Paper
Eulerian colorings and the bipartizing matchings conjecture of Fleischner2006-11-15Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\)2006-09-28Paper
List coloring of Cartesian products of graphs2006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54881042006-09-13Paper
https://portal.mardi4nfdi.de/entity/Q54807272006-08-03Paper
A Brooks-Type Theorem for the Generalized List T-Coloring2006-06-01Paper
The last excluded case of Dirac's map‐color theorem for choosability2006-05-16Paper
Coloring mixed hypertrees2006-04-28Paper
Group coloring is \(\Pi_2^{\text{P}}\)-complete2006-03-20Paper
Extending partial 5-colorings and 6-colorings in planar graphs2006-01-10Paper
Locally consistent constraint satisfaction problems2006-01-09Paper
STACS 20052005-12-02Paper
A note on group colorings2005-11-07Paper
Coloring Powers of Chordal Graphs2005-09-16Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Automata, Languages and Programming2005-08-24Paper
https://portal.mardi4nfdi.de/entity/Q54660862005-08-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Coloring graphs from lists with bounded size of their union2005-08-01Paper
Hamilton cycles in strong products of graphs2005-05-04Paper
Cyclic, diagonal and facial colorings2005-03-08Paper
An exact algorithm for the channel assignment problem2005-02-22Paper
Coloring face hypergraphs on surfaces2005-01-11Paper
Pancyclicity of strong products of graphs2004-12-13Paper
Hajós' theorem for list coloring2004-11-18Paper
It is tough to be a plumber2004-10-27Paper
On feasible sets of mixed hypergraphs2004-10-13Paper
Borodin's conjecture on diagonal coloring is false2004-10-04Paper
A revival of the girth conjecture2004-10-01Paper
Mixed hypercacti2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q30437242004-08-06Paper
Edge-disjoint odd cycles in planar graphs.2004-03-15Paper
On maximum face-constrained coloring of plane graphs with no short face cycles.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44487642004-02-18Paper
A Theorem about the Channel Assignment Problem2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44056542003-09-05Paper
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44144942003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47085892003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q47827462002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47791662002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45363832002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27666892002-07-09Paper
On planar mixed hypergraphs2001-12-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Daniel Král'