1 citations · 1 across the 6 of their papers we have counts for
6 papers
Tight cuts in matching covered graphs
Fuliang Lu, Fengming Dong
An edge cut C of a graph G is tight if |C \M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of ti…
Extremal 1-planar graphs without k-cliques
Licheng Zhang, Yuanqiu Huang, Fengming Dong
In 2016, Dowden initiated the study of planar Turán-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every -free -planar…
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…
Determining the minimum size of maximal 1-plane graphs
Yuanqiu Huang, Zhangdong Ouyang, Licheng Zhang +1
A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without vio…
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…
A new infinite family of 4-regular crossing-critical graphs
Zongpeng Ding, Yuanqiu Huang, Fengming Dong
A graph is said to be crossing-critical if for every edge of , where is the crossing number of . Richter and Thomassen [Journal of Combinator…