2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2018
On Degree Properties of Crossing-Critical Families of Graphs
Drago Bokal, Mojca Bračič, Marek Derňár +1
Answering an open question from 2007, we construct infinite -crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~…
math.CO2016
The crossing number of the cone of a graph
Carlos A. Alfaro, Alan Arroyo, Marek Derunár +1
Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph and the crossing number of…
cs.CC2015★ 2 cited
Crossing Number is Hard for Kernelization
Petr Hliněný, Marek Derňár
The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult,…