8 citations · 8 across the 2 of their papers we have counts for
2 papers
math.CO2011★ 8 cited
Minimum degree condition forcing complete graph immersion
Matt DeVos, Zdeněk Dvořák, Jacob Fox +3
An immersion of a graph into a graph is a one-to-one mapping and a collection of edge-disjoint paths in , one for each edge of , such that the path…
math.CO2010
Sub-exponentially many 3-colorings of triangle-free planar graphs
Arash Asadi, Zdenek Dvorak, Luke Postle +1
Thomassen conjectured that every triangle-free planar graph on n vertices has exponentially many 3-colorings, and proved that it has at least 2^[n^(1/12)/20000] distinct 3-coloring…