On total covers of graphs. - Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang (Discret. Math., 1992)

A short proof of Nash-Williams' theorem for the arboricity of a graph. - Boliong Chen; Makoto Matsumoto; Jianfang Wang; Zhongfu Zhang; Jianxun Zhang (Graphs Comb., 1994)

A six-color theorem for the edge-face coloring of plane graphs. - Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang (Discret. Math., 1995)

The vertex-face total chromatic number of Halin graphs. - Peter Che Bor Lam; Zhongfu Zhang (Networks, 1997)

On the Relations Between Arboricity and Independent Number Or Covering Number. - Zhongfu Zhang; Linzhong Liu; Jianxun Zhang; Jianfang Wang (Discret. Appl. Math., 1998)

On mixed Ramsey numbers. - Baogen Xu; Zhongfu Zhang (Discret. Math., 1999)

A note on the lower bounds of signed domination number of a graph. - Zhongfu Zhang; Baogen Xu; Yinzhen Li; Linzhong Liu (Discret. Math., 1999)

On the equitable chromatic number of complete n-partite graphs. - Peter Che Bor Lam; Wai Chee Shiu; Chong Sze Tong; Zhongfu Zhang (Discret. Appl. Math., 2001)

Adjacent strong edge coloring of graphs. - Zhongfu Zhang; Linzhong Liu; Jianfang Wang (Appl. Math. Lett., 2002)

An inequality between the diameter and the inverse dual degree of a tree. - Man-Keung Siu; Zhongfu Zhang; Sanming Zhou (Discret. Math., 2002)

Some properties of Ramsey numbers. - Zhongfu Zhang; Linzhong Liu; Jinwen Li; Enmin Song (Appl. Math. Lett., 2003)

The relation of matching with inverse degree of a graph. - Zhongfu Zhang; Jianxun Zhang; Xinzhong Lu (Discret. Math., 2005)

Utilize Fuzzy Data Mining to Find the Living Pattern of Customers in Hotels. - Xu Xu; Zhongfu Zhang; Zhihong Feng; Yansong Li (FSKD (2), 2007)

Upper Bounds on the D(beta)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs. - Jing-jing Tian; Xin-sheng Liu; Zhongfu Zhang; Fang'an Deng (International Conference on Computational Science (3), 2007)

On Graceful Generalized Spiders and Caterpillars. - Hui Cheng; Bing Yao; Xiangen Chen; Zhongfu Zhang (Ars Comb., 2008)

On the vertex distinguishing equitable edge-coloring of graphs. - Zhongfu Zhang; Mu-chun Li; Bing Yao; Baogen Xu; Zhiwen Wang; Jingwen Li 001 (Ars Comb., 2008)

Vertex-distinguishing total coloring of graphs. - Zhongfu Zhang; Pengxiang Qiu; Baogen Xu; Jingwen Li 001; Xiangen Chen; Bing Yao (Ars Comb., 2008)

On Incidence Graphs. - Zhongfu Zhang; Bing Yao; Jingwen Li 001; Linzhong Liu; Jianfang Wang; Baogen Xu (Ars Comb., 2008)

Adjacent Vertex Reducible Edge-Total Coloring of Graphs. - Jingwen Li 001; Zhongfu Zhang; Enqiang Zhu; Wenhui Xu; Fei Wen; Lin Li; Ji Zhang (BMEI, 2009)

A note on the vertex-distinguishing proper total coloring of graphs. - Jingwen Li 001; Zhiwen Wang; Zhongfu Zhang; Enqiang Zhu; Fei Wen; Hongjie Wang (Ars Comb., 2010)

On the adjacent vertex distinguishing total chromatic number of outer plane graph. - Zhiwen Wang; Li-hong Yan; Jaeun Lee; Zhongfu Zhang (Ars Comb., 2012)

Edge-chromatic numbers of Mycielski graphs. - Young Soo Kwon; Jaeun Lee; Zhongfu Zhang (Discret. Math., 2012)