- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c2 |      | Jianfang Wang, Qiuling Zhang, Huilai Zhi: Fault Diagnosis and Optimization for Agent Based on the D-S Evidence Theory. ICSI (2) 2012: 535-542 |
| 2009 | ||
| c1 | | Jianfang Wang, Weihua Li: Optimization Algorithm Based on T-S Fuzzy Model of Self-Adaptive Disturbed Particle Swarm Optimization and Neural Network. HIS (1) 2009: 457-461 |
| 2008 | ||
| j18 |  | Zhongfu Zhang, Bing Yao, Jingwen Li, Linzhong Liu, Jianfang Wang, Baogen Xu: On Incidence Graphs. Ars Comb. 87 (2008) |
| 2006 | ||
| j17 | | T. T. Lee, T. Y. Lo, Jianfang Wang: An information-lossless decomposition theory of relational information systems. IEEE Transactions on Information Theory 52(5): 1890-1903 (2006) |
| 2003 | ||
| j16 | | Ping Wang, Baoguang Xu, Jianfang Wang: A Note on the Edge-Connectivity of Cages. Electr. J. Comb. 10 (2003) |
| j15 | | Taro Tokuda, Baoguang Xu, Jianfang Wang: Connected Factors and Spanning Trees in Graphs. Graphs and Combinatorics 19(2): 259-262 (2003) |
| 2002 | ||
| j14 | | Zhongfu Zhang, Linzhong Liu, Jianfang Wang: Adjacent strong edge coloring of graphs. Appl. Math. Lett. 15(5): 623-626 (2002) |
| j13 | | Baoguang Xu, Ping Wang, Jianfang Wang: On the Connectivity of (4;g)-Cages. Ars Comb. 64: 181- (2002) |
| j12 | | Jianfang Wang, Haizhu Li: The upper bound of essential cyclomatic numbers of hypergraphs. Discrete Mathematics 254(1-3): 555-564 (2002) |
| j11 | | Baoguang Xu, Jianfang Wang: On the Hamiltonian cycle Decompositions of Complete 3-Uniform Hypergraphs. Electronic Notes in Discrete Mathematics 11: 722-733 (2002) |
| 2001 | ||
| j10 | | Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan: Linear Vertex Arboricity, Independence Number and Clique Cover Number. Ars Comb. 58 (2001) |
| 1999 | ||
| j9 | | Liang Sun, Jianfang Wang: An Upper Bound for the Independent Domination Number. J. Comb. Theory, Ser. B 76(2): 240-246 (1999) |
| 1998 | ||
| j8 | | Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang: On the Relations Between Arboricity and Independent Number Or Covering Number. Discrete Applied Mathematics 87(1-3): 279-283 (1998) |
| 1995 | ||
| j7 | | Jianfang Wang, Douglas B. West, Bing Yao: Maximum Bandwidth Under Edge Addition. Journal of Graph Theory 20(1): 87-90 (1995) |
| 1994 | ||
| j6 | | Boliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang: A short proof of Nash-Williams' theorem for the arboricity of a graph. Graphs and Combinatorics 10(1): 27-28 (1994) |
| j5 | | Yousef Alavi, Jiuqiang Liu, Jianfang Wang: On linear vertex-arboricity of complementary graphs. Journal of Graph Theory 18(3): 315-322 (1994) |
| 1993 | ||
| j4 | | Yousef Alavi, Jiuqiang Liu, Jianfang Wang: Highly irregular digraphs. Discrete Mathematics 111(1-3): 3-10 (1993) |
| j3 | | Ciping Chen, Jianfang Wang: Factors in graphs with odd-cycle property. Discrete Mathematics 112(1-3): 29-40 (1993) |
| 1992 | ||
| j2 | | Yousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang: On total covers of graphs. Discrete Mathematics 100(1-3): 229-233 (1992) |
| 1988 | ||
| j1 | | Jianfang Wang: On point-linear arboricity of planar graphs. Discrete Mathematics 72(1-3): 381-384 (1988) |
Colors in the list of coauthors
Last update Tue May 21 15:56:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page