Advanced search

Authors whose works are in public domain in at least one jurisdiction

List of works by Daniel Kráľ

1-50 of 135 results

View this query on the Wikidata Query Service
Non-Three-Colourable Common Graphs Exist

article published in 2012
Finitely forcible graphons and permutons

A combinatorial proof of the Removal Lemma for Groups

A New Bound for the 2/3 Conjecture

article by DANIEL KRÁL' et al published 23 January 2013 in Combinatorics, Probability and Computing
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

scientific article published in February 2003
Quasirandom permutations are characterized by 4-point densities

Large permutations and parameter testing

scholarly article from 'arXiv:1412.5622v1 [cs.DM]' published in 2014
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
FO Model Checking of Interval Graphs

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

article published in 2008
6-Critical Graphs on the Klein Bottle

Monochromatic triangles in three-coloured graphs

article by James Cummings et al published July 2013 in Journal of Combinatorial Theory, Series B
Exponentially many perfect matchings in cubic graphs

The Channel Assignment Problem with Variable Weights

Hamilton cycles in prisms

article
Coloring of Triangle-Free Graphs on the Double Torus

Coloring Powers of Chordal Graphs

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

Coloring Mixed Hypertrees

Cyclic, diagonal and facial colorings—a missing case

article
Testing first-order properties for subclasses of sparse graphs

Tough spiders

article
Equipartite graphs

article
Pancyclicity of Strong Products of Graphs

article
Deciding First-Order Properties for Sparse Graphs

Domination number of cubic graphs with large girth

Fullerene graphs have exponentially many perfect matchings

article
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
Markov bases of binary graph models of K 4 -minor free graphs

article published in 2010
Extending Fractional Precolorings

Third Case of the Cyclic Coloring Conjecture

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

Short Cycle Covers of Graphs with Minimum Degree Three

article
A removal lemma for systems of linear equations over finite fields

Densities in large permutations and parameter testing

scholarly article published in 2017
On the number of pentagons in triangle-free graphs

Counting flags in triangle-free digraphs

article published in 2009
Cyclic, diagonal and facial colorings

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

A note on antisymmetric flows in graphs

article published in 2010
Mixed hypergraphs and other coloring problems

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

article published in 2010
Counting flags in triangle-free digraphs

article published in 2016
Triangles in arrangements of points and lines in the plane

scientific article published in April 2011
Colorings Of Plane Graphs With No Rainbow Faces

article by Veselin Jungić et al published April 2006 in Combinatorica
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs

Fractional total colourings of graphs of high girth

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

Free binary decision diagrams for the computation of EARn

Classes of graphs with small rank decompositions are χ -bounded

Paulina is supported by:

About Paulina

Help