Zhongfu Zhang

According to our database1, Zhongfu Zhang authored at least 22 papers between 1992 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Edge-chromatic numbers of Mycielski graphs.
Discret. Math., 2012

On the adjacent vertex distinguishing total chromatic number of outer plane graph.
Ars Comb., 2012

2010
A note on the vertex-distinguishing proper total coloring of graphs.
Ars Comb., 2010

2009
Adjacent Vertex Reducible Edge-Total Coloring of Graphs.
Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009

2008
On Incidence Graphs.
Ars Comb., 2008

Vertex-distinguishing total coloring of graphs.
Ars Comb., 2008

On the vertex distinguishing equitable edge-coloring of graphs.
Ars Comb., 2008

On Graceful Generalized Spiders and Caterpillars.
Ars Comb., 2008

2007
Upper Bounds on the <i>D</i>(<i>beta</i>)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Utilize Fuzzy Data Mining to Find the Living Pattern of Customers in Hotels.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

2005
The relation of matching with inverse degree of a graph.
Discret. Math., 2005

2003
Some properties of Ramsey numbers.
Appl. Math. Lett., 2003

2002
An inequality between the diameter and the inverse dual degree of a tree.
Discret. Math., 2002

Adjacent strong edge coloring of graphs.
Appl. Math. Lett., 2002

2001
On the equitable chromatic number of complete n-partite graphs.
Discret. Appl. Math., 2001

1999
A note on the lower bounds of signed domination number of a graph.
Discret. Math., 1999

On mixed Ramsey numbers.
Discret. Math., 1999

1998
On the Relations Between Arboricity and Independent Number Or Covering Number.
Discret. Appl. Math., 1998

1997
The vertex-face total chromatic number of Halin graphs.
Networks, 1997

1995
A six-color theorem for the edge-face coloring of plane graphs.
Discret. Math., 1995

1994
A short proof of Nash-Williams' theorem for the arboricity of a graph.
Graphs Comb., 1994

1992
On total covers of graphs.
Discret. Math., 1992


  Loading...