Yiqiao Wang

Orcid: 0000-0002-5322-1312

Affiliations:
  • Zhejiang Normal University, Department of Mathematics, Jinhua, China
  • Beijing University of Chinese Medicine, Beijing, China
  • Department of Mathematics, Zhejiang Normal University, Jinhua, China


According to our database1, Yiqiao Wang authored at least 66 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the order of antipodal covers.
J. Graph Theory, February, 2024

A note on rainbow-free colorings of uniform hypergraphs.
Discret. Appl. Math., February, 2024

2023
Coloring the square of maximal planar graphs with diameter two.
Appl. Math. Comput., December, 2023

Predicting blood pressure from face videos using face diagnosis theory and deep neural networks technique.
Comput. Biol. Medicine, September, 2023

Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems.
Inf. Sci., July, 2023

On critical graphs for the chromatic edge-stability number.
Discret. Math., May, 2023

The Difference of Zagreb Indices of Halin Graphs.
Axioms, May, 2023

Strict neighbor-distinguishing index of K4-minor-free graphs.
Discret. Appl. Math., April, 2023

L(2, 1)-Labeling Halin Graphs with Maximum Degree Eight.
Symmetry, 2023

Proximity ranking-based multimodal differential evolution.
Swarm Evol. Comput., 2023

Function value ranking aware differential evolution for global numerical optimization.
Swarm Evol. Comput., 2023

Plane graphs of diameter two are 2-optimal.
Appl. Math. Comput., 2023

2022
Star Chromatic Index of 1-Planar Graphs.
Symmetry, 2022

Light edges in 1-planar graphs.
J. Graph Theory, 2022

Structure and pancyclicity of maximal planar graphs with diameter two.
J. Comb. Optim., 2022

Two sufficient conditions for a planar graph to be list vertex-2-arborable.
Discret. Math., 2022

Strong Chromatic Index of Outerplanar Graphs.
Axioms, 2022

2021
IC-Planar Graphs Are 6-Choosable.
SIAM J. Discret. Math., 2021

Network vulnerability parameter and results on two surfaces.
Int. J. Intell. Syst., 2021

Strict Neighbor-Distinguishing Index of Subcubic Graphs.
Graphs Comb., 2021

Entire coloring of 2-connected plane graphs.
Eur. J. Comb., 2021

2020
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
J. Graph Theory, 2020

Plane graphs with Δ =7 are entirely 10-colorable.
J. Comb. Optim., 2020

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.
J. Comb. Optim., 2020

An improved upper bound for the acyclic chromatic number of 1-planar graphs.
Discret. Appl. Math., 2020

Computation on the difference of Zagreb indices of maximal planar graphs with diameter two.
Appl. Math. Comput., 2020

2019
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.
J. Comb. Optim., 2019

Acyclic coloring of IC-planar graphs.
Discret. Math., 2019

Light structures in 1-planar graphs with an application to linear 2-arboricity.
Discret. Appl. Math., 2019

Star edge-coloring of graphs with maximum degree four.
Appl. Math. Comput., 2019

List coloring and diagonal coloring for plane graphs of diameter two.
Appl. Math. Comput., 2019

2018
Planar graphs without chordal 5-cycles are 2-good.
J. Comb. Optim., 2018

Strong chromatic index of <i>K</i><sub>4</sub>-minor free graphs.
Inf. Process. Lett., 2018

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.
Graphs Comb., 2018

A note on the list vertex arboricity of toroidal graphs.
Discret. Math., 2018

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.
Discret. Math., 2018

Edge-partition and star chromatic index.
Appl. Math. Comput., 2018

2017
The entire chromatic number of graphs embedded on the torus with large maximum degree.
Theor. Comput. Sci., 2017

A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable.
J. Comb. Optim., 2017

A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1.
J. Comb. Optim., 2017

Neighbor-sum-distinguishing edge choosability of subcubic graphs.
J. Comb. Optim., 2017

A sufficient condition for planar graphs to be (3, 1)-choosable.
J. Comb. Optim., 2017

On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles.
Int. J. Comput. Math., 2017

A note on the linear 2-arboricity of planar graphs.
Discret. Math., 2017

The chromatic number of the square of a Halin graph with maximum degree five is six.
Ars Comb., 2017

2016
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.
J. Glob. Optim., 2016

The entire choosability of plane graphs.
J. Comb. Optim., 2016

Plane graphs with maximum degree 9 are entirely 11-choosable.
Discret. Math., 2016

2015
Some bounds on the neighbor-distinguishing index of graphs.
Discret. Math., 2015

Equitable total-coloring of subcubic graphs.
Discret. Appl. Math., 2015

2014
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.
SIAM J. Discret. Math., 2014

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.
J. Comb. Optim., 2014

Plane graphs are entirely (δ + 5)-Choosable.
Discret. Math. Algorithms Appl., 2014

The edge-face choosability of plane graphs with maximum degree at least 9.
Discret. Math., 2014

2013
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.
J. Graph Theory, 2013

Acyclic edge coloring of planar graphs without 4-cycles.
J. Comb. Optim., 2013

Linear Coloring of Planar Graphs Without 4-Cycles.
Graphs Comb., 2013

A new upper bound on the acyclic chromatic indices of planar graphs.
Eur. J. Comb., 2013

Acyclic list edge coloring of outerplanar graphs.
Discret. Math., 2013

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.
Discret. Appl. Math., 2013

2012
Acyclic edge coloring of planar graphs without 5-cycles.
Discret. Appl. Math., 2012

Every 4-regular graph is acyclically edge-6-colorable
CoRR, 2012

2011
Adjacent vertex-distinguishing edge colorings of K<sub>4</sub>-minor free graphs.
Appl. Math. Lett., 2011

2010
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.
J. Comb. Optim., 2010

Adjacent vertex distinguishing total colorings of outerplanar graphs.
J. Comb. Optim., 2010

2006
L(p, q)-labelling of K<sub>4</sub>-minor free graphs.
Inf. Process. Lett., 2006


  Loading...