30 citations · 208 across the 26 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 21 cited
Improved enumeration of simple topological graphs
Jan Kynčl
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges…
cs.DM2012★ 17 cited
Graph sharing games: complexity and connectivity
Josef Cibulka, Jan Kynčl, Viola Mészáros +2
We study the following combinatorial game played by two players, Alice and Bob, which generalizes the Pizza game considered by Brown, Winkler and others. Given a connected graph G…
math.CO2012★ 2 cited
Improvement on the decay of crossing numbers
Jakub Černý, Jan Kynčl, Géza Tóth
We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every…