35 citations · 53 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2010★ 35 cited
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
Vít Jelínek, Eva Jelínková, Jan Kratochvíl +3
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum n…
math.CO2010★ 1 cited
Segment representation of a subclass of co-planar graphs
Mathew C. Francis, Jan Kratochvíl, Tomáš Vyskočil
A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their correspondin…