- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j19 |      | Zhiwen Wang, Li-hong Yan, Jaeun Lee, Zhongfu Zhang: On the adjacent vertex distinguishing total chromatic number of outer plane graph. Ars Comb. 107: 499-514 (2012) |
| j18 |  | Young Soo Kwon, Jaeun Lee, Zhongfu Zhang: Edge-chromatic numbers of Mycielski graphs. Discrete Mathematics 312(6): 1222-1225 (2012) |
| 2010 | ||
| j17 | | Jingwen Li, Zhiwen Wang, Zhongfu Zhang, Enqiang Zhu, Fei Wen, Hongjie Wang: A note on the vertex-distinguishing proper total coloring of graphs. Ars Comb. 96 (2010) |
| 2009 | ||
| c3 | | Jingwen Li, Zhongfu Zhang, Enqiang Zhu, Wenhui Xu, Fei Wen, Lin Li, Ji Zhang: Adjacent Vertex Reducible Edge-Total Coloring of Graphs. BMEI 2009: 1-3 |
| 2008 | ||
| j16 | | Zhongfu Zhang, Mu-chun Li, Bing Yao, Baogen Xu, Zhiwen Wang, Jingwen Li: On the vertex distinguishing equitable edge-coloring of graphs. Ars Comb. 86 (2008) |
| j15 | | Hui Cheng, Bing Yao, Xiangen Chen, Zhongfu Zhang: On Graceful Generalized Spiders and Caterpillars. Ars Comb. 87 (2008) |
| j14 | | Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiangen Chen, Bing Yao: Vertex-distinguishing total coloring of graphs. Ars Comb. 87 (2008) |
| j13 | | Zhongfu Zhang, Bing Yao, Jingwen Li, Linzhong Liu, Jianfang Wang, Baogen Xu: On Incidence Graphs. Ars Comb. 87 (2008) |
| 2007 | ||
| c2 | | Xu Xu, Zhongfu Zhang, Zhihong Feng, Yansong Li: Utilize Fuzzy Data Mining to Find the Living Pattern of Customers in Hotels. FSKD (2) 2007: 60-64 |
| c1 | | Jing-jing Tian, Xin-sheng Liu, Zhongfu Zhang, Fang'an Deng: Upper Bounds on the D(beta)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs. International Conference on Computational Science (3) 2007: 453-456 |
| 2005 | ||
| j12 | | Zhongfu Zhang, Jianxun Zhang, Xinzhong Lu: The relation of matching with inverse degree of a graph. Discrete Mathematics 301(2-3): 243-246 (2005) |
| 2003 | ||
| j11 | | Zhongfu Zhang, Linzhong Liu, Jinwen Li, Enmin Song: Some properties of Ramsey numbers. Appl. Math. Lett. 16(8): 1187-1193 (2003) |
| 2002 | ||
| j10 | | Zhongfu Zhang, Linzhong Liu, Jianfang Wang: Adjacent strong edge coloring of graphs. Appl. Math. Lett. 15(5): 623-626 (2002) |
| j9 | | Man-Keung Siu, Zhongfu Zhang, Sanming Zhou: An inequality between the diameter and the inverse dual degree of a tree. Discrete Mathematics 259(1-3): 351-358 (2002) |
| 2001 | ||
| j8 | | Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang: On the equitable chromatic number of complete n-partite graphs. Discrete Applied Mathematics 113(2-3): 307-310 (2001) |
| 1999 | ||
| j7 | | Zhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu: A note on the lower bounds of signed domination number of a graph. Discrete Mathematics 195(1-3): 295-298 (1999) |
| j6 | | |
| 1998 | ||
| j5 | | 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) |
| 1997 | ||
| j4 | | Peter Che Bor Lam, Zhongfu Zhang: The vertex-face total chromatic number of Halin graphs. Networks 30(3): 167-170 (1997) |
| 1995 | ||
| j3 | | Cuiqin Lin, Guanzhang Hu, Zhongfu Zhang: A six-color theorem for the edge-face coloring of plane graphs. Discrete Mathematics 141(1-3): 291-297 (1995) |
| 1994 | ||
| j2 | | 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) |
| 1992 | ||
| j1 | | Yousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang: On total covers of graphs. Discrete Mathematics 100(1-3): 229-233 (1992) |
Colors in the list of coauthors
Last update Sun May 26 00:58:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page