Supported by the National Natural Science Foundation of China(10671177)
In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the problem and its worst-ease performance is analyzed. The lower bounds of optimal solution ...
Supported by the Natural Science Foundation of Gansu Province (3ZS051-A25-025).
ErdOs,Gimbel and Straight (1990) conjectured that if ω(G)〈5 and z(G)〉3,then z(G)≥Z(G)-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triang...
A set of n points in the plane determines a total C 2 n distances (some of them may be the same).Let r n be the ratio of the maximum distance to the minimum distance, and R n be the greatest lower bound for r n. ...
Research supported by the National Natural Science Foundation of China( 1 0 2 31 0 1 0 ) ;Trans- CenturyTraining Programme Foundation for Talents by the Ministry of Education of China;Natural ScienceFoundation of Zhejiang provinc
Let M be an n-dimensional compact Riemannian manifold with or without boundary,and its Ricci curvature Ric M≥n-1.The paper obtains an inequality for the first eigenvalue η 1 of M with mixed boundary condition,whic...
The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous kn...
It is proved that every 3 connected loopless multigraph has maximum genus at least one third of its cycle rank plus one if its cycle rank is not less than ten, and if its cycle rank is less than ten,it is upper emb...