58 citations · 549 across the 45 of their papers we have counts for
5 papers · 2 filters
Short proofs of coloring theorems on planar graphs
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický +1
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Grötzsch Theorem that every planar tri…
5-list-coloring planar graphs with distant precolored vertices
Zdenek Dvorak, Bernard Lidicky, Bojan Mohar +1
We answer positively the question of Albertson asking whether every planar graph can be -list-colored even if it contains precolored vertices, as long as they are sufficiently f…
On the Turan number of forests
Bernard Lidický, Hong Liu, Cory Palmer
The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the uniq…
5-choosability of graphs with crossings far apart
Zdenek Dvorak, Bernard Lidicky, Bojan Mohar
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings…
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
József Balogh, Ping Hu, Bernard Lidický +1
In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cyc…