|
1.
On
the Size and Construction of Maximum Critically h-Edge-Connected Graphs (I) (Chinese)
. Applied
Math. J. Chinese Univ. 3 (4)
(1988), 537-542
2.
The
Constructions of Maximum Critically 3-Edge-Connected Graphs with Every Vertex
Adjacent to the Vertex of Degree Three (Chinese).
J. China
Univ. Sci. Tech. 17
(3) (1987), 441-447. MR89f:05112
3.
The
Structural Characters of the Critically h-Edge-Connected Graphs (Chinese).
J. Engineering
Math. 3 (2) (1986),
165-168
4.
A
Note on the Algebraic Connectivity of Graphs (Chinese).
J. Xingjiang Univ.
3 (3) (1986), 113-114. MR87k:05112
5.
On
the Lower Bound of the Maximum Size of a Critically h-Edge-Connected and a
Critically h-Connected Graph (Chinese)
(with Tian Feng).
J. Huazhong Univ. Sci. Tech. 14 (2) (1986), 147-152
6.
On
the Maximum Size of a Critically 3-Edge-Connected Graph
(Chinese).
J.
Xingjiang Univ. 2 (4) (1985), 123
7.
On
the Constructions of Critically 2-Connected Graphs (Chinese).
J. China
Univ. Sci. Tech. 15
(1985), 11-21
8.
Proof
of the Maxied Form of Menger's Theorem in Graph Theory (Chinese).
J. Huazhong Univ. Sci. Tech. 12 (2) (1984),
17-18. MR87g:05142
9.
Proof
of a Conjecture of Simon and Murty (Chinese).
J. Huazhong Univ. Sci. Tech. 12 (4) (1984),
85-86. MR87i:05125. Erratum,
5 (4) (1985), 38; 7(2)
(1987), 198. MR88m:05054
10.
The
Tree Solution of the Transportation Problem (Chinese).
J. China
Univ. Sci. Tech. 12
(1982), 11-18
|
