Wei Fan Wang

From MaRDI portal
Person:977288

Available identifiers

zbMath Open wang.wei-fanMaRDI QIDQ977288

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61893922024-02-08Paper
https://portal.mardi4nfdi.de/entity/Q61886472024-02-07Paper
Acyclic edge coloring of 1-planar graphs without 4-cycles2024-01-16Paper
Light edges in 1‐planar graphs2023-10-05Paper
Remarks on component factors2023-09-12Paper
IC-planar graphs are odd-10-colorable2023-06-26Paper
1-planar graphs are odd 13-colorable2023-05-31Paper
The matchings and spectral radius of graphs involving minimum degree2023-05-08Paper
2-distance choosability of planar graphs with a restriction for maximum degree2023-04-21Paper
Local neighbor-distinguishing index of graphs2023-03-17Paper
Neighbor-distinguishing indices of planar graphs with maximum degree ten2023-02-24Paper
Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs2023-02-24Paper
An \((F_3,F_5)\)-partition of planar graphs with girth at least 52022-11-23Paper
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs2022-10-13Paper
子立方平面图的$(1,0)$-松弛强边列表染色2022-09-29Paper
A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable2022-06-21Paper
Toughness condition for a graph to be all fractional (g,f,n)-critical deleted2022-06-03Paper
Surviving rate of graphs and firefighter problem2022-05-25Paper
Strict neighbor-distinguishing total index of graphs2022-04-25Paper
Two sufficient conditions for a planar graph to be list vertex-2-arborable2022-04-11Paper
Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable2022-03-31Paper
Adjacent vertex distinguishing index of bipartite planar graphs2022-03-21Paper
Edge-face coloring of 2-connected plane graphs2022-03-21Paper
A local condition for planar graphs to be 4-choosable2022-03-21Paper
On the neighbor-distinguishing indices of planar graphs2022-03-21Paper
Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion2022-02-10Paper
Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles2022-02-09Paper
Nowhere-zero 3-flows in toroidal graphs2022-01-26Paper
On 3-flow-critical graphs2022-01-07Paper
最大度为6 的平面图为第一类的一个新充分条件2021-12-17Paper
Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs2021-12-17Paper
Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree2021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q33850732021-12-17Paper
Acyclic edge coloring of chordal graphs with bounded degree2021-11-30Paper
On the arithmetic-geometric index of graphs2021-11-15Paper
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs2021-10-19Paper
https://portal.mardi4nfdi.de/entity/Q33807502021-09-29Paper
IC-Planar Graphs Are 6-Choosable2021-08-20Paper
https://portal.mardi4nfdi.de/entity/Q49981532021-07-01Paper
https://portal.mardi4nfdi.de/entity/Q49901272021-05-28Paper
An improved upper bound on the linear 2-arboricity of 1-planar graphs2021-05-10Paper
Entire coloring of 2-connected plane graphs2021-04-14Paper
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles2021-04-09Paper
Strict neighbor-distinguishing index of subcubic graphs2021-03-17Paper
An improved upper bound for the acyclic chromatic number of 1-planar graphs2020-06-29Paper
Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles2020-06-09Paper
Two-distance vertex-distinguishing index of sparse subcubic graphs2020-06-09Paper
The extension degree conditions for fractional factor2020-04-15Paper
List vertex-arboricity of planar graphs without intersecting 5-cycles2020-04-15Paper
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve2020-02-03Paper
Choosability with separation of planar graphs without prescribed cycles2020-01-15Paper
List coloring and diagonal coloring for plane graphs of diameter two2020-01-09Paper
Star edge-coloring of graphs with maximum degree four2019-11-22Paper
Edge-partition and star chromatic index2019-11-13Paper
Acyclic coloring of IC-planar graphs2019-10-17Paper
Acyclic edge coloring of 4-regular graphs. II.2019-09-20Paper
Light structures in 1-planar graphs with an application to linear 2-arboricity2019-09-05Paper
Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable2019-06-25Paper
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree2019-06-21Paper
Acyclic edge coloring of 4-regular graphs without 3-cycles2019-01-31Paper
Linear 2-arboricity of toroidal graphs2019-01-31Paper
Entire coloring of graphs embedded in a surface of nonnegative characteristic2019-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45586442018-11-29Paper
A note on the list vertex arboricity of toroidal graphs2018-10-23Paper
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)2018-09-21Paper
2-distance vertex-distinguishing index of subcubic graphs2018-07-26Paper
On choosability with separation of planar graphs without adjacent short cycles2018-07-24Paper
Planar graphs without chordal 6-cycles are 4-choosable2018-05-24Paper
Planar graphs with maximum degree 4 are strongly 19-edge-colorable2018-04-19Paper
Planar graphs without chordal 5-cycles are 2-good2018-04-13Paper
2-distance vertex-distinguishing total coloring of graphs2018-04-10Paper
Degree sum condition for fractional ID-$k$-factor-critical graphs2018-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31343862018-02-09Paper
Neighbor-sum-distinguishing edge choosability of subcubic graphs2017-11-16Paper
A sufficient condition for planar graphs to be (3,1)-choosable2017-11-09Paper
Strong chromatic index of \(K_4\)-minor free graphs2017-10-18Paper
A tight neighborhood union condition on fractional $(g,f,n’,m)$-critical deleted graphs2017-10-10Paper
The entire chromatic number of graphs embedded on the torus with large maximum degree2017-09-07Paper
Neighbor sum distinguishing index of subcubic graphs2017-08-10Paper
The fifth geometric-arithmetic index of bridge graph and carbon nanocones2017-08-08Paper
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)2017-06-22Paper
A characterization of L(2, 1)-labeling number for trees with maximum degree 32017-05-17Paper
https://portal.mardi4nfdi.de/entity/Q29873092017-05-17Paper
The eccentric connectivity polynomial of two classes of nanotubes2017-05-12Paper
A note on the linear 2-arboricity of planar graphs2017-05-10Paper
New isolated toughness condition for fractional $(g,f,n)$-critical graphs2017-03-08Paper
A \((3,1)^\ast\)-choosable theorem on planar graphs2016-10-12Paper
Full Orientability of the Square of a Cycle2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28247042016-10-06Paper
The vertex version of weighted Wiener number for bicyclic molecular structures2016-08-30Paper
Plane graphs with maximum degree 9 are entirely 11-choosable2016-07-05Paper
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles2016-06-16Paper
https://portal.mardi4nfdi.de/entity/Q28118322016-06-10Paper
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs2016-05-25Paper
The 2-surviving rate of planar graphs without 5-cycles2016-05-11Paper
The entire choosability of plane graphs2016-04-13Paper
Rainbow cliques in edge-colored graphs2016-02-29Paper
A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable2016-02-23Paper
Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time2016-02-05Paper
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree2016-01-04Paper
https://portal.mardi4nfdi.de/entity/Q55011712015-08-13Paper
Some bounds on the neighbor-distinguishing index of graphs2015-06-29Paper
\((2,1)\)-total labeling of trees with large maximum degree2015-06-10Paper
Equitable total-coloring of subcubic graphs2015-04-28Paper
Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable2015-04-17Paper
https://portal.mardi4nfdi.de/entity/Q49828982015-04-13Paper
https://portal.mardi4nfdi.de/entity/Q49829032015-04-13Paper
https://portal.mardi4nfdi.de/entity/Q51737082015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q54982782015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54967522015-01-27Paper
https://portal.mardi4nfdi.de/entity/Q54967542015-01-27Paper
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five2015-01-21Paper
Adjacent vertex distinguishing indices of planar graphs without 3-cycles2014-12-19Paper
Acyclic 6-choosability of planar graphs without adjacent short cycles2014-12-02Paper
Structural properties and surviving rate of planar graphs2014-11-28Paper
https://portal.mardi4nfdi.de/entity/Q29236532014-11-03Paper
Plane graphs with maximum degree 6 are edge-face 8-colorable2014-09-19Paper
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph2014-09-12Paper
The surviving rate of digraphs2014-08-14Paper
On Neighbor-Distinguishing Index of Planar Graphs2014-08-07Paper
Star list chromatic number of planar subcubic graphs2014-06-24Paper
A lower bound of the surviving rate of a planar graph with girth at least seven2014-06-24Paper
The edge-face choosability of plane graphs with maximum degree at least 92014-05-06Paper
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle2014-04-10Paper
The adjacent vertex distinguishing total coloring of planar graphs2014-04-08Paper
https://portal.mardi4nfdi.de/entity/Q54030102014-03-25Paper
The 2-surviving rate of planar graphs without 6-cycles2014-01-13Paper
Vertex arboricity of planar graphs without chordal 6-cycles2013-12-23Paper
https://portal.mardi4nfdi.de/entity/Q28644372013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28644672013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28587362013-11-19Paper
Class I graphs of nonnegative characteristic without special cycles2013-11-19Paper
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 42013-07-31Paper
Linear coloring of planar graphs without 4-cycles2013-07-19Paper
https://portal.mardi4nfdi.de/entity/Q49265432013-06-20Paper
Acyclic edge coloring of planar graphs without 4-cycles2013-06-13Paper
6-Star-Coloring of Subcubic Graphs2013-03-07Paper
https://portal.mardi4nfdi.de/entity/Q49009502013-01-24Paper
Acyclic list edge coloring of outerplanar graphs2013-01-03Paper
Some results on the injective chromatic number of graphs2013-01-03Paper
https://portal.mardi4nfdi.de/entity/Q48983172012-12-30Paper
A new upper bound on the acyclic chromatic indices of planar graphs2012-12-03Paper
A note on the adjacent vertex distinguishing total chromatic number of graphs2012-11-20Paper
Planar graphs of maximum degree six without 7-cycles are class one2012-10-24Paper
The 2-surviving rate of planar graphs without 4-cycles2012-10-11Paper
https://portal.mardi4nfdi.de/entity/Q29180482012-10-05Paper
An improved bound on parity vertex colourings of outerplane graphs2012-09-12Paper
On the vertex-arboricity of planar graphs without 7-cycles2012-08-10Paper
On backbone coloring of graphs2012-07-10Paper
Acyclic chromatic indices of planar graphs with girth at least five2012-07-10Paper
(2,1)-total number of joins of paths and cycles2012-06-04Paper
Acyclic edge coloring of planar graphs without 5-cycles2012-05-30Paper
Vertex-arboricity of planar graphs without intersecting triangles2012-05-04Paper
The surviving rate of planar graphs2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31095262012-01-27Paper
Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs2011-12-28Paper
Entire colouring of plane graphs2011-12-08Paper
https://portal.mardi4nfdi.de/entity/Q31700992011-09-29Paper
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six2011-09-20Paper
Acyclic chromatic indices of planar graphs with large girth2011-08-10Paper
https://portal.mardi4nfdi.de/entity/Q30170682011-07-19Paper
The surviving rate of an outerplanar graph for the firefighter problem2011-02-21Paper
Upper bounds on the linear chromatic number of a graph2011-02-18Paper
https://portal.mardi4nfdi.de/entity/Q30702382011-02-02Paper
Choosability of toroidal graphs without short cycles2010-11-10Paper
https://portal.mardi4nfdi.de/entity/Q30517212010-11-05Paper
The surviving rate of an infected network2010-10-11Paper
\((2,1)\)-Total number of trees with maximum degree three2010-08-20Paper
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35776022010-07-22Paper
On 3-colorability of planar graphs without adjacent short cycles2010-06-21Paper
(2,1)-total labelling of trees with sparse vertices of maximum degree2010-06-16Paper
Adjacent vertex distinguishing total colorings of outerplanar graphs2010-04-26Paper
A relaxation of Havel's 3-color problem2010-04-19Paper
On 3-colorable planar graphs without cycles of four lengths2010-03-24Paper
https://portal.mardi4nfdi.de/entity/Q34046832010-02-12Paper
Three-coloring planar graphs without short cycles2010-01-29Paper
Planar graphs without 4-cycles are acyclically 6-choosable2009-12-18Paper
Star coloring of sparse graphs2009-12-18Paper
Linear coloring of planar graphs with large girth2009-12-15Paper
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles2009-12-10Paper
On \((d,1)\)-total numbers of graphs2009-12-09Paper
Linear coloring of graphs embeddable in a surface of nonnegative characteristic2009-12-02Paper
Some results on distance two labelling of outerplanar graphs2009-11-13Paper
https://portal.mardi4nfdi.de/entity/Q36419862009-11-11Paper
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles2009-11-06Paper
https://portal.mardi4nfdi.de/entity/Q53205772009-07-22Paper
Improper choosability of graphs of nonnegative characteristic2009-07-18Paper
Injective coloring of planar graphs2009-06-30Paper
Edge choosability of planar graphs without 5-cycles with a chord2009-06-19Paper
The edge-face coloring of graphs embedded in a surface of characteristic zero2009-06-19Paper
https://portal.mardi4nfdi.de/entity/Q36112922009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36113092009-03-06Paper
On 3-colorable planar graphs without short cycles2009-01-29Paper
Acyclic 5-choosability of planar graphs without 4-cycles2009-01-28Paper
Diameters of uniform subset graphs2009-01-28Paper
Adjacent vertex distinguishing total coloring of graphs with lower average degree2008-09-29Paper
Labelling planar graphs without 4-cycles with a condition on distance two2008-09-29Paper
Coupled choosability of plane graphs2008-05-14Paper
On the vertex-arboricity of planar graphs2008-05-13Paper
Planar graphs without 4, 6, 8-cycles are 3-colorable2008-03-11Paper
Coloring the square of an outerplanar graph2008-02-22Paper
\((2,1)\)-total labelling of outerplanar graphs2007-11-30Paper
On 3-colorable planar graphs without prescribed cycles2007-11-27Paper
A sufficient condition for a planar graph to be class I2007-10-18Paper
Edge choosability of planar graphs without short cycles2007-05-29Paper
Acyclic 5-choosability of planar graphs without small cycles2007-03-20Paper
https://portal.mardi4nfdi.de/entity/Q34248932007-03-05Paper
Total chromatic number of planar graphs with maximum degree ten2007-02-09Paper
https://portal.mardi4nfdi.de/entity/Q34154642007-01-19Paper
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability2006-12-07Paper
https://portal.mardi4nfdi.de/entity/Q34088342006-11-15Paper
https://portal.mardi4nfdi.de/entity/Q54923042006-10-13Paper
Edge-face chromatic number of 2-connected plane graphs with high maximum degree2006-10-05Paper
Some sufficient conditions for a planar graph of maximum degree six to be Class 12006-08-04Paper
Bordeaux 3-color conjecture and 3-choosability2006-05-16Paper
The \(L(2,1)\)-labelling of trees2006-04-28Paper
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers2006-03-29Paper
Entire chromatic number and \(\Delta\)-matching of outerplane graphs2006-02-21Paper
https://portal.mardi4nfdi.de/entity/Q57007542005-10-31Paper
https://portal.mardi4nfdi.de/entity/Q54635072005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q46800362005-06-01Paper
Equitable list coloring of graphs2005-04-18Paper
Vertex-pancyclicity of edge-face-total graphs2004-11-23Paper
The edge-face choosability of plane graphs2004-10-13Paper
Labeling Planar Graphs with Conditions on Girth and Distance Two2004-01-08Paper
Coloring the square of a \(K_{4}\)-minor free graph2003-08-19Paper
The linear 2-arboricity of planar graphs2003-08-18Paper
Relaxed game chromatic number of graphs2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47831252003-04-02Paper
Equitable total coloring of graphs with maximum degree 32003-03-25Paper
Edge-partitions of planar graphs and their game coloring numbers2003-03-19Paper
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles2003-01-05Paper
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs2002-08-29Paper
Choosability and edge choosability of planar graphs without five cycles2002-08-15Paper
https://portal.mardi4nfdi.de/entity/Q27648802002-07-22Paper
A seven-color theorem on edge-face coloring of plane graphs2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q27673582002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27604372002-01-02Paper
Choosability, edge choosability and total choosability of outerplane graphs2001-11-13Paper
A note on list improper coloring planar graphs2001-08-07Paper
https://portal.mardi4nfdi.de/entity/Q27219262001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27217912001-07-10Paper
https://portal.mardi4nfdi.de/entity/Q27208392001-06-27Paper
https://portal.mardi4nfdi.de/entity/Q27153472001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q45283732001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45183682000-12-14Paper
https://portal.mardi4nfdi.de/entity/Q45057662000-09-28Paper
Upper bounds of entire chromatic number of plane graphs1999-09-15Paper
https://portal.mardi4nfdi.de/entity/Q42220881999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42352181999-03-22Paper
The total chromatic number of pseudo-outerplanar graphs1998-07-08Paper
On the colorings of outerplanar graphs1996-03-24Paper
https://portal.mardi4nfdi.de/entity/Q42787951994-02-24Paper
The complete chromatic number of some planar graphs1994-02-07Paper
https://portal.mardi4nfdi.de/entity/Q40319641993-04-22Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Wei Fan Wang