Showing math.COShow all
2 papers · 1 filter
math.CO2026
Unit distance graphs with few crossings per edge
Panna Gehér, Dömötör Pálvölgyi, Dániel G. Simon +1
A graph is called a -planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most crossings. We investig…
math.CO2024
Saturated Partial Embeddings of Maximal Planar Graphs
Alexander Clifton, Dániel G. Simon
We investigate two notions of saturation for partial planar embeddings of maximal planar graphs. Let be a vertex-labeled maximal planar graph on vertices, which…