Zhongfu Zhang

From MaRDI portal
Revision as of 15:25, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Zhongfu Zhang to Zhongfu Zhang: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:221702

Available identifiers

zbMath Open zhang.zhongfuMaRDI QIDQ221702

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50985392022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q51004972022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q51005232022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q51005642022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q50990342022-08-31Paper
https://portal.mardi4nfdi.de/entity/Q50628892022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50631132022-03-17Paper
A lower bound for the size of 9-critical graphs2016-03-07Paper
A note on edge coloring of graphs2016-03-07Paper
https://portal.mardi4nfdi.de/entity/Q34611292016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q34611342016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q31934262015-10-28Paper
Erratum to: ``Vertex-distinguishing E-total colorings of graphs2014-10-07Paper
On defected colourings of graphs2014-03-14Paper
On the adjacent vertex distinguishing total chromatic number of outer plane graph.2013-12-06Paper
The adjacent vertex distinguishing vertex-edge total coloring of some join graphs2012-10-05Paper
On the adjacent vertex-distinguishing acyclic edge coloring of some graphs2012-10-05Paper
Equitable total chromatic numbers of the square graphs of some graphs2012-06-01Paper
A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data2012-06-01Paper
Edge-chromatic numbers of Mycielski graphs2012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q31181132012-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31105822012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31102362012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31097252012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31106122012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31706612011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31701592011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30176692011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30722312011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30727742011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30722252011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30722362011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30702832011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702722011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702482011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702862011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30663212011-01-10Paper
https://portal.mardi4nfdi.de/entity/Q30545762010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30525052010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30518072010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30540712010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30549452010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30549142010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30518822010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30549072010-11-05Paper
Some results on spanning trees2010-10-29Paper
On the relations of graph parameters and its total parameters2010-09-20Paper
https://portal.mardi4nfdi.de/entity/Q35727882010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35721662010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35739952010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35728092010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q34053702010-02-12Paper
Adjacent strong edge colorings and total colorings of regular graphs2009-12-02Paper
Equitable total coloring of \(F_n \vee W_n\)2009-11-13Paper
https://portal.mardi4nfdi.de/entity/Q36418292009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36401822009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36446942009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36418262009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36415402009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36401692009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36402592009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36403322009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36446642009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36445642009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q53228312009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53204472009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53202892009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q36094342009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36094002009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q35387512008-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35387502008-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35379692008-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35165312008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35165322008-08-06Paper
On the adjacent-vertex-strongly-distinguishing total coloring of graphs2008-06-25Paper
https://portal.mardi4nfdi.de/entity/Q35017162008-06-03Paper
https://portal.mardi4nfdi.de/entity/Q35010052008-06-03Paper
AVDTC numbers of generalized Halin graphs with maximum degree at least 62008-05-26Paper
https://portal.mardi4nfdi.de/entity/Q54529532008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54530822008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54561792008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54420392008-02-15Paper
Vertex distinguishing equitable total chromatic number of join graphs2008-01-25Paper
https://portal.mardi4nfdi.de/entity/Q54372642008-01-18Paper
https://portal.mardi4nfdi.de/entity/Q54374312008-01-18Paper
https://portal.mardi4nfdi.de/entity/Q54359462008-01-14Paper
https://portal.mardi4nfdi.de/entity/Q54247752007-11-06Paper
https://portal.mardi4nfdi.de/entity/Q53107712007-10-12Paper
https://portal.mardi4nfdi.de/entity/Q53096412007-10-09Paper
https://portal.mardi4nfdi.de/entity/Q57545902007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q57545922007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52958892007-07-31Paper
https://portal.mardi4nfdi.de/entity/Q52958902007-07-31Paper
https://portal.mardi4nfdi.de/entity/Q52949762007-07-26Paper
On the relations between the parameters of graphs2007-07-26Paper
https://portal.mardi4nfdi.de/entity/Q34457022007-06-06Paper
https://portal.mardi4nfdi.de/entity/Q34367332007-05-11Paper
https://portal.mardi4nfdi.de/entity/Q34313692007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34314502007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34314512007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34314522007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34314532007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34311802007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34311822007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34311902007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34311812007-04-05Paper
\(D(\beta)\)-vertex-distinguishing total coloring of graphs2007-02-16Paper
https://portal.mardi4nfdi.de/entity/Q34226412007-02-13Paper
https://portal.mardi4nfdi.de/entity/Q34172812007-01-29Paper
https://portal.mardi4nfdi.de/entity/Q34150782007-01-15Paper
https://portal.mardi4nfdi.de/entity/Q34135832006-12-13Paper
https://portal.mardi4nfdi.de/entity/Q34134882006-12-12Paper
A note on adjacent strong edge coloring of \(K(n,m)\)2006-10-24Paper
Edge-face chromatic number of 2-connected plane graphs with high maximum degree2006-10-05Paper
https://portal.mardi4nfdi.de/entity/Q54898882006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54899142006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54905172006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54852632006-08-29Paper
https://portal.mardi4nfdi.de/entity/Q54773322006-07-03Paper
https://portal.mardi4nfdi.de/entity/Q54773382006-07-03Paper
https://portal.mardi4nfdi.de/entity/Q54714952006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q54715952006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q54681602006-05-24Paper
https://portal.mardi4nfdi.de/entity/Q54681612006-05-24Paper
https://portal.mardi4nfdi.de/entity/Q33750792006-03-01Paper
https://portal.mardi4nfdi.de/entity/Q33668292006-02-16Paper
https://portal.mardi4nfdi.de/entity/Q33668312006-02-16Paper
https://portal.mardi4nfdi.de/entity/Q33668252006-02-16Paper
The relation of matching with inverse degree of a graph2006-01-10Paper
On adjacent-vertex-distinguishing total coloring of graphs2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q53126872005-09-01Paper
https://portal.mardi4nfdi.de/entity/Q30249482005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q30246792005-07-01Paper
https://portal.mardi4nfdi.de/entity/Q46698622005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q48257942004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48093842004-08-24Paper
Some properties of Ramsey numbers2004-06-15Paper
https://portal.mardi4nfdi.de/entity/Q44690112004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44690082004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44690142004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44689962004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44690152004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44498862004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q47987162003-09-21Paper
https://portal.mardi4nfdi.de/entity/Q47830702003-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45432552003-01-20Paper
On the edge-binding number of some plane graphs2002-09-25Paper
Adjacent strong edge coloring of graphs2002-08-15Paper
On the equitable chromatic number of complete \(n\)-partite graphs2002-08-14Paper
https://portal.mardi4nfdi.de/entity/Q44990362002-06-03Paper
The Hopfield neural network model and algorithm for domination numbers of graphs2002-02-28Paper
A note on the neural network model for cover numbers of graphs2002-02-28Paper
On some problems of integer flows2002-01-15Paper
A note on the edge-face total chromatic number of maximal outerplanar graphs2001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q45258432001-08-19Paper
The total chromatic number of a hexagonal system2001-06-20Paper
On the adjacent strong edge colorings of \(3\)-regular Halin graphs2001-06-20Paper
A note on Goldberg's problem concerning the edge chromatic number2001-06-20Paper
The complete chromatic number of some planar graphs2001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q45226792001-06-13Paper
https://portal.mardi4nfdi.de/entity/Q45037072001-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45258422001-01-25Paper
https://portal.mardi4nfdi.de/entity/Q45018062000-09-10Paper
https://portal.mardi4nfdi.de/entity/Q45018012000-09-10Paper
https://portal.mardi4nfdi.de/entity/Q45018052000-09-10Paper
https://portal.mardi4nfdi.de/entity/Q47189652000-04-10Paper
On mixed Ramsey numbers2000-02-16Paper
https://portal.mardi4nfdi.de/entity/Q38369262000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q49361112000-01-26Paper
A note on the lower bounds of signed domination number of a graph2000-01-09Paper
A note on the total chromatic number of Halin graphs with maximum degree 41999-11-25Paper
https://portal.mardi4nfdi.de/entity/Q47019601999-11-23Paper
Arboricity and complement of a graph1999-11-03Paper
https://portal.mardi4nfdi.de/entity/Q42310751999-03-15Paper
https://portal.mardi4nfdi.de/entity/Q42310761999-03-15Paper
https://portal.mardi4nfdi.de/entity/Q43978091999-03-09Paper
A note on \(n\)-edge chromatic number1998-12-02Paper
On the relations between arboricity and independent number or covering number1998-11-03Paper
https://portal.mardi4nfdi.de/entity/Q43811451998-04-01Paper
The lower bounds of classic Ramsey number \(R(5,9)\) and \(R(5,10)\)1998-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48796631997-11-16Paper
The vertex-face total chromatic number of Halin graphs1997-11-06Paper
On the complete chromatic number of Halin graphs1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q31229761997-03-06Paper
https://portal.mardi4nfdi.de/entity/Q48690681996-07-28Paper
https://portal.mardi4nfdi.de/entity/Q48710881996-07-28Paper
https://portal.mardi4nfdi.de/entity/Q48675341996-05-30Paper
Bounds on the lower size of a 7-critical graph1995-10-23Paper
A six-color theorem for the edge-face coloring of plane graphs1995-07-24Paper
https://portal.mardi4nfdi.de/entity/Q43260711995-03-30Paper
https://portal.mardi4nfdi.de/entity/Q43117881995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q42858421994-06-22Paper
A short proof of Nash-Williams' theorem for the arboricity of a graph1994-05-10Paper
The complete chromatic number of some planar graphs1994-02-07Paper
https://portal.mardi4nfdi.de/entity/Q31375781993-10-20Paper
https://portal.mardi4nfdi.de/entity/Q40378861993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40377611993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40319641993-04-22Paper
On total covers of graphs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40199111993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40160721992-12-16Paper
https://portal.mardi4nfdi.de/entity/Q40045591992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40101291992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39904801992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39777731992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39777711992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39777771992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39777781992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33587521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34833181990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800901990-01-01Paper
Total chromatic number of graphs of high degree1990-01-01Paper
Relation between arboricities of a graph and its complement graph1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33563211990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800731989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800741989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34817381989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800601989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34953861989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079201988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47312231988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38031371987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37820441986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30290301986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316221985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37641861985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374511984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33285861983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39562231982-01-01Paper

Research outcomes over time

This page was built for person: Zhongfu Zhang