default search action
Zhongfu Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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. Discret. Math. 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)
2000 – 2009
- 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. Discret. Math. 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. Discret. Math. 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. Discret. Appl. Math. 113(2-3): 307-310 (2001)
1990 – 1999
- 1999
- [j7]Zhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu:
A note on the lower bounds of signed domination number of a graph. Discret. Math. 195(1-3): 295-298 (1999) - [j6]Baogen Xu, Zhongfu Zhang:
On mixed Ramsey numbers. Discret. Math. 199(1-3): 285-289 (1999) - 1998
- [j5]Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang:
On the Relations Between Arboricity and Independent Number Or Covering Number. Discret. Appl. Math. 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. Discret. Math. 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 Comb. 10(1): 27-28 (1994) - 1992
- [j1]Yousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang:
On total covers of graphs. Discret. Math. 100(1-3): 229-233 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: