4 papers
Oriented Diameter of Mixed Graphs with Given Maximum Undirected Degree
Ran An, Hengzhe Li, Jianbing Liu +1
In 2018, Dankelmann, Gao, and Surmacs [J. Graph Theory, 88(1): 5--17, 2018] established sharp bounds on the oriented diameter of a bridgeless undirected graph and a bridgeless undi…
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,…
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…