Search filters

List of works by Daniel Kráľ

6-Critical Graphs on the Klein Bottle

A Brooks-Type Theorem for the Generalized List T-Coloring

A New Bound for the 2/3 Conjecture

article by DANIEL KRÁL' et al published 23 January 2013 in Combinatorics, Probability and Computing

A New Lower Bound Based on Gromov’s Method of Selecting Heavily Covered Points

article by Daniel Kráľ et al published 14 March 2012 in Discrete and Computational Geometry

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs

article by Daniel Kráľ et al published January 2009 in SIAM Journal on Discrete Mathematics

A Theorem about the Channel Assignment Problem

A bound on the inducibility of cycles

article by Daniel Kráľ et al published January 2019 in Journal of Combinatorial Theory, Series A

A combinatorial proof of the Removal Lemma for Groups

A note on antisymmetric flows in graphs

article published in 2010

A note on group colorings

A problem of Erdős and Sós on 3-graphs

A removal lemma for systems of linear equations over finite fields

A revival of the girth conjecture

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs

Algorithms for Classes of Graphs with Bounded Expansion

scholarly article by Zdeněk Dvořák & Daniel Kráľ published 2010 in Lecture Notes in Computer Science

An application of flag algebras to a problem of Erdős and Sós

scholarly article by Roman Glebov et al published September 2013 in Electronic Notes in Discrete Mathematics

An exact algorithm for the channel assignment problem

scholarly article by Daniel Kráľ published January 2005 in Discrete Applied Mathematics

An improved linear bound on the number of perfect matchings in cubic graphs

article by Louis Esperet et al published July 2010 in European Journal of Combinatorics

Borodin’s conjecture on diagonal coloring is false

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

article published in 2008

Brooks’ Theorem via the Alon–Tarsi Theorem

Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs

Characterization of affine Steiner triple systems and Hall triple systems

Circular edge-colorings of cubic graphs with girth six

Circular edge-colorings of cubic graphs with girth six

Classes of graphs with small rank decompositions are χ -bounded

Closure for the property of having a hamiltonian prism

Coloring Eulerian Triangulations of the Klein Bottle

Coloring Mixed Hypertrees

Coloring Powers of Chordal Graphs

Coloring even-faced graphs in the torus and the Klein bottle

Coloring face hypergraphs on surfaces

Coloring graphs from lists with bounded size of their union

Coloring mixed hypertrees

Coloring of Triangle-Free Graphs on the Double Torus

Coloring plane graphs with independent crossings

article

Coloring squares of planar graphs with girth six

Colorings Of Plane Graphs With No Rainbow Faces

article by Veselin Jungić et al published April 2006 in Combinatorica

Compactness and finite forcibility of graphons

scientific article published on 24 June 2019

Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings

Counting flags in triangle-free digraphs

article published in 2016

Counting flags in triangle-free digraphs

article published in 2009

Cubic bridgeless graphs have more than a linear number of perfect matchings

Cyclic colorings of plane graphs with independent faces

Cyclic, diagonal and facial colorings

Cyclic, diagonal and facial colorings—a missing case

article

Deciding First-Order Properties for Sparse Graphs

Decomposition Width of Matroids

article

Decomposition width of matroids

Densities in large permutations and parameter testing ⬇️

scholarly article from 'European Journal of Combinatorics' published in 2017

Distance Constrained Labelings of -minor Free Graphs

article by Daniel Kráľ & Pavel Nejedlý published March 2007 in Electronic Notes in Discrete Mathematics

Distance constrained labelings of K 4 -minor free graphs

article by Daniel Kráľ et al published September 2009 in Discrete Mathematics

Distance constrained labelings of planar graphs with no short cycles

article by Zdeněk Dvořák et al published June 2009 in Discrete Applied Mathematics

Domination number of cubic graphs with large girth

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems

Edge-disjoint odd cycles in planar graphs

Elusive extremal graphs

scientific article published on 19 August 2020

Equipartite graphs

article

Equipartite polytopes

Eulerian colorings and the bipartizing matchings conjecture of Fleischner

Exponentially many perfect matchings in cubic graphs

Extending Fractional Precolorings

Extending partial 5-colorings and 6-colorings in planar graphs

Extensions of Fractional Precolorings Show Discontinuous Behavior

FO Model Checking of Interval Graphs

FO Model Checking of Interval Graphs

Facial colorings using Hall’s Theorem

Finitely forcible graph limits are universal

scientific article published in December 2018

Finitely forcible graphons and permutons

First order convergence of matroids

Forcing generalised quasirandom graphs efficiently

scientific article published on 5 September 2023

Fractional colorings of cubic graphs with large girth

Fractional total colourings of graphs of high girth

Free binary decision diagrams for the computation of EARn

Fullerene graphs have exponentially many perfect matchings

article

Graph labellings with variable weights, a survey

Graphs with bounded tree-width and large odd-girth are almost bipartite

article by Alexandr V. Kostochka et al published November 2010 in Journal of Combinatorial Theory, Series B

Group coloring is Π 2 P -complete

Hajós' theorem for list coloring

Hamilton cycles in prisms

article

Hamilton cycles in strong products of graphs

Hamiltonian threshold for strong products of graphs

Hereditary properties of permutations are strongly testable ⬇️

conference paper from 'Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms' published in 2014

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 ⬇️

scholarly article from 'arXiv:1412.5622v1 [cs.DM]' published in 2014

Limit Behavior of Locally Consistent Constraint Satisfaction Problems

List coloring of Cartesian products of graphs

List colorings with measurable sets

Locally Consistent Constraint Satisfaction Problems with Binary Constraints

Locally consistent constraint satisfaction problems

Long cycles in fullerene graphs

Markov bases of binary graph models of K 4 -minor free graphs

article published in 2010

Matchings and Nonrainbow Colorings

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

scientific article published in 2022

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 and other coloring problems

article published in 2007

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

scientific article published in February 2003

Monochromatic triangles in three-coloured graphs

article by James Cummings et al published July 2013 in Journal of Combinatorial Theory, Series B

Non-Three-Colourable Common Graphs Exist

article published in 2012

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs

article by Zdeněk Dvořák et al published 2009 in Journal of Graph Theory

On maximum face-constrained coloring of plane graphs with no short face cycles

article by Daniel Kráľ published February 2004 in Discrete Mathematics

On the number of pentagons in triangle-free graphs

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

article

Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice

Probabilistic strategies for the partition and plurality problems

scholarly article by Zdeněk Dvořák et al published 2006 in Random Structures and Algorithms

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

Short Cycle Covers of Graphs with Minimum Degree Three

article

Six-Critical Graphs on the Klein Bottle

Steinberg's Conjecture is false

scientific article published in January 2017

Testing first-order properties for subclasses of sparse graphs

The Channel Assignment Problem with Variable Weights

The Last Fraction of a Fractional Conjecture

The circular chromatic index of graphs of high girth

The fractional chromatic number of triangle-free subcubic graphs

The last excluded case of Dirac's map-color theorem for choosability

The step Sidorenko property and non-norming edge-transitive graphs

article by Daniel Kráľ et al published February 2019 in Journal of Combinatorial Theory, Series A

Third Case of the Cyclic Coloring Conjecture

Third case of the Cyclic Coloring Conjecture

scholarly article by Michael Hebdige & Daniel Kráľ published November 2015 in Electronic Notes in Discrete Mathematics

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle

Tough spiders

article

Toughness threshold for the existence of 2-walks in K 4 -minor-free graphs

article published in 2010

Triangles in arrangements of points and lines in the plane

scientific article published in April 2011

Unions of perfect matchings in cubic graphs

Weak regularity and finitely forcible graph limits

scholarly article by Jacob W. Cooper et al published November 2015 in Electronic Notes in Discrete Mathematics

Paulina is supported by:

About Paulina

Help