5 papers
Complexity and Algorithm for the Matching vertex-cutset Problem
Hengzhe Li, Qiong Wang, Jianbing Liu +1
In 1985, Chvátal introduced the concept of star cutsets as a means to investigate the properties of perfect graphs, which inspired many researchers to study cutsets with some speci…
Diameter two orientability of mixed graphs
Hengzhe Li, Zhiwei Ding, Jianbing Liu +1
In 1967, Katona and Szemerédi showed that no undirected graph with vertices and fewer than edges admits an orientation of diameter two. In 1978,…
Characterization of Equimatchable Even-Regular Graphs
Xiao Zhao, Haojie Zheng, Fengming Dong +2
The study of equimatchable graphs traces back to Sumner (1979), followed by the foundational work of Lesk, Plummer, and Pulleyblank in 1984. Regarding the characterization of equim…
A Note on Improved bounds for the Oriented Radius of Mixed Multigraphs
Hengzhe Li, Zhiwei Ding, Jianbing Liu +2
For a positive integer , let denote the smallest number such that any 2-edge connected mixed graph with radius has an oriented radius of at most . Recently, Bab…
The -structure-connectivity of graphs
Xiao Zhao, Haojie Zheng, Hengzhe Li
In this paper, we mainly investigate -structure-connectivity for any connected graph. Let be a connected graph with vertices, we show that is well-…