8 citations · 13 across the 5 of their papers we have counts for
5 papers
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Daniel Král', Rok Erman +2
Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such t…
Coloring plane graphs with independent crossings
Daniel Král', Ladislav Stacho
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether…
Markov bases of binary graph models of K_4-minor free graphs
Daniel Král', Serguei Norine, Ondrej Pangrác
Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a…
A Removal Lemma for Systems of Linear Equations over Finite Fields
Dan Král', Oriol Serra, Lluís Vena
We prove a removal lemma for systems of linear equations over finite fields: let be subsets of the finite field $\F_q$ and let be a matrix with coef…
A combinatorial proof of the Removal Lemma for Groups
Daniel Král', Oriol Serra, Lluís Vena
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemerédi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian g…