8 citations · 9 across the 5 of their papers we have counts for
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011
Obstacles, Slopes, and Tic-Tac-Toe: An excursion in discrete geometry and combinatorial game theory
V S Padmini Mukkamala
A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of are represented by distinct points in the plane and every edge is represented by a straight-…
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
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…