Current location - Education and Training Encyclopedia - Graduation thesis - Liu Xinsheng's Representative Papers
Liu Xinsheng's Representative Papers
An upper bound of the adjacent vertex-distinguishing acyclic edge chromatic number of 1. graphs

Graphics, Journal of Applied Mathematics (English Edition), 2009.0 1, Liu Xinsheng.

2. An upper bound of the adjacent vertex distinguishing total chromatic number of a graph,

Research and development of mathematics. Expo, March 2009, Liu Xinsheng.

3. An upper bound of the edge chromatic number of graphs with a maximum degree of not less than 7, Journal of Lanzhou University (Natural Science Edition), April 2008, Liu Xinsheng, Deng Kai.

4. A polynomial approximation algorithm for 4.TSP, Journal of Northwest Normal University (Natural Science Edition). Liu Xinsheng; Chen Haiyu

5. An upper bound of vertex-distinguishing IE- total chromatic number of graphs, Journal of Han Dong University, Liu Xinsheng, Zhu Zhiqiang.

6. Adjacent vertex distinguishing total chromatic number of 2- connected outer plane graph with 6.δ (g) = 5, Journal of Northwest Normal University (Natural Science Edition), Zhang Shaojun: Chen Xiangen; Liu Xinsheng.

7. Limited signal distribution and half-star chromatic number, Journal of Northwest Normal University (Natural Science Edition), Liu Xinsheng; Deng Kai.

8. Adjacent vertex distinguishing total chromatic number of s _ m ∨ p _ n ∨ p _ n, Journal of Lanzhou University of Technology, Liu Xinsheng; Tian Jingjing.

9. Circular chromatic number of 9.I (c _ n), Journal of Lanzhou University, Liu Xinsheng; Deng Kai.

10. 2- distance chromatic number of weak direct product graphs, Journal of Lanzhou University of Technology, Liu Xinsheng; Yu Lanlan.