2 papers
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.CO2025
The density of maximal IC-plane graphs and maximal NIC-plane graphs
Zongpeng Ding, Yuanqiu Huang, Fengming Dong +2
In this paper, we show that any maximal IC-plane graph of order has at least edges, and any maximal NIC-plane graph of order…