#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2001

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yufa Shen, Wenjie He, Guoping Zheng, Yanpo Li
- Appl. Math. Lett.
- 2009

- Yufa Shen, Wenjie He, Guoping Zheng, Yanning Wang, Lingmin Zhang
- Discrete Mathematics
- 2008

A graph G is said to be chromatic-choosable if ch(G)= (G). Ohba has conjectured that every graph G with 2 (G)+ 1 or fewer vertices is chromatic-choosable. It is clear that Ohba’s conjecture is true if and only if it is true for complete multipartite graphs. But for complete multipartite graphs, the graphs for which Ohba’s conjecture has been verified are… (More)

- Yufa Shen, Guoping Zheng, Wenjie He, Yongqiang Zhao
- Discrete Mathematics
- 2008

- Wenjie He, Wenjing Miao, Yufa Shen
- Discrete Mathematics
- 2008

Thomassen showed in 1994 that all planar graphs are 5-choosable; Škrekovski showed in 1998 that allK5-minor-free graphs also are 5-choosable. In this short paper we prove this result using another method. © 2007 Elsevier B.V. All rights reserved. MSC: 05C15

- Yufa Shen, Wenjie He, Xue Li, Donghong He, Xiaojing Yang
- Discrete Applied Mathematics
- 2008

- Yanning Wang, Yufa Shen, Guoping Zheng, Wenjie He
- Ars Comb.
- 2009

- Yufa Shen, Yanming Wang, Wenjie He, Yongqiang Zhao
- Ars Comb.
- 2008

- Wenjie He, Yufa Shen, Yongqiang Zhao, Yanning Wang, Xinmiao Ma
- Australasian J. Combinatorics
- 2006

- Wenjie He, Xinkai Yu, Honghai Mi, Yong Xu, Yufa Shen, Lixin Wang
- Discrete Mathematics
- 2002

A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst.… (More)