4 papers
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…
The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
Zhangdong Ouyang, Yuanqiu Huang, Licheng Zhang +1
A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-p…
The generalized 4-connectivity of burnt pancake graphs
Jing Wang, Jiang Wu, Zhangdong Ouyang +1
The generalized -connectivity of a graph , denoted by , is the minimum number of internally edge disjoint -trees for any and . The general…
On the size of matchings in 1-planar graph with high minimum degree
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recen…