Zhongfu Zhang - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2012

Edge-chromatic numbers of Mycielski graphsYoung Soo Kwon, Jaeun Lee, Zhongfu Zhang. DM, 312(6):1222-1225, 2012. [doi]

On the adjacent vertex distinguishing total chromatic number of outer plane graphZhiwen Wang, Li-hong Yan, Jaeun Lee, Zhongfu Zhang. arscom, 107:499-514, 2012.

2010

A note on the vertex-distinguishing proper total coloring of graphsJingwen Li 0001, Zhiwen Wang, Zhongfu Zhang, Enqiang Zhu, Fei Wen, Hongjie Wang. arscom, 96, 2010.

2009

Adjacent Vertex Reducible Edge-Total Coloring of GraphsJingwen Li, Zhongfu Zhang, Enqiang Zhu, Wenhui Xu, Fei Wen, Lin Li, Ji Zhang. bmei 2009: 1-3 [doi]

2008

2007

Upper Bounds on the ::::D::::(::::beta::::)-Vertex-Distinguishing Edge-Chromatic Numbers of GraphsJing-jing Tian, Xin-sheng Liu, Zhongfu Zhang, Fang an Deng. iccS 2007: 453-456 [doi]

Utilize Fuzzy Data Mining to Find the Living Pattern of Customers in HotelsXu Xu, Zhongfu Zhang, Zhihong Feng, Yansong Li. fskd 2007: 60-64 [doi]

2005

The relation of matching with inverse degree of a graphZhongfu Zhang, Jianxun Zhang, Xinzhong Lu. DM, 301(2-3):243-246, 2005. [doi]

2003

Some properties of Ramsey numbersZhongfu Zhang, Linzhong Liu, Jinwen Li, Enmin Song. appml, 16(8):1187-1193, 2003. [doi]

2002

An inequality between the diameter and the inverse dual degree of a treeMan-Keung Siu, Zhongfu Zhang, Sanming Zhou. DM, 259(1-3):351-358, 2002. [doi]

Adjacent strong edge coloring of graphsZhongfu Zhang, Linzhong Liu, Jianfang Wang. appml, 15(5):623-626, 2002. [doi]

2001

On the equitable chromatic number of complete n-partite graphsPeter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang. DAM, 113(2-3):307-310, 2001.

1999

On mixed Ramsey numbersBaogen Xu, Zhongfu Zhang. DM, 199(1-3):285-289, 1999. [doi]

A note on the lower bounds of signed domination number of a graphZhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu. DM, 195(1-3):295-298, 1999. [doi]

1998

On the Relations Between Arboricity and Independent Number Or Covering NumberZhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang. DAM, 87(1-3):279-283, 1998. [doi]

1997

The vertex-face total chromatic number of Halin graphsPeter Che Bor Lam, Zhongfu Zhang. networks, 30(3):167-170, 1997. [doi]

1995

A six-color theorem for the edge-face coloring of plane graphsCuiqin Lin, Guanzhang Hu, Zhongfu Zhang. DM, 141(1-3):291-297, 1995. [doi]

1994

A short proof of Nash-Williams' theorem for the arboricity of a graphBoliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang. gc, 10(1):27-28, 1994. [doi]

1992

On total covers of graphsYousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang. DM, 100(1-3):229-233, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL