8 citations · 10 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 8 cited
Drawing cubic graphs with the four basic slopes
Padmini Mukkamala, Dömötör Pálvölgyi
We show that every cubic graph can be drawn in the plane with straight-line edges using only the four basic slopes . We also prove that four slopes have this pr…
math.CO2011★ 1 cited
Saturating Sperner families
Dániel Gerbner, Balázs Keszegh, Nathan Lemons +3
A family $\cF \subseteq 2^{[n]}$ saturates the monotone decreasing property $\cP$ if $\cF$ satisfies $\cP$ and one cannot add any set to $\cF$ such that property $\cP$ is still sat…
math.CO2011★ 1 cited
Lower bounds on the obstacle number of graphs
Padmini Mukkamala, János Pach, Dömötör Pálvölgyi
Given a graph , an {\em obstacle representation} of is a set of points in the plane representing the vertices of , together with a set of connected obstacles such that tw…