3 papers
math.CO2026
On the Restricted Edge-Cuts of Optimal 1-Planar Graphs
Licheng Zhang, Zhangdong Ouyang, Yuanqiu Huang +1
The restricted edge-connectivity of a graph is the minimum size of an edge-cut whose removal leaves every component with at least two vertices. In 2024, Zhang et al. showed that th…
math.CO2025
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
Guiping Wang
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y . A 1-disk OX…
math.CO2025
The minimum size of maximal bipartite IC-plane graphs with given connectivity
Guiping Wang, Yuanqiu Huang, Zhangdong Ouyang +1
Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angeli…