Yiqiao Wang

,

Juan Liu

,

Discuss. Math. Graph Theory, 2024

A note on the list vertex-arboricity of IC-planar graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2024

A sufficient condition for a graph to be fractional (k,n)-critical.

[BibT_eX]

[DOI]

Wei Gao

,

,

Discret. Math., 2024

Coloring the square of maximal planar graphs with diameter two.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., December, 2023

Predicting blood pressure from face videos using face diagnosis theory and deep neural networks technique.

[BibT_eX]

[DOI]

,

,

,

,

Comput. Biol. Medicine, September, 2023

Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Inf. Sci., July, 2023

On critical graphs for the chromatic edge-stability number.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., May, 2023

The Difference of Zagreb Indices of Halin Graphs.

[BibT_eX]

[DOI]

Lina Zheng

,

,

Axioms, May, 2023

Strict neighbor-distinguishing index of K4-minor-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., April, 2023

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

[BibT_eX]

[DOI]

Haizhen Qiu

,

Yushi Che

,

Symmetry, 2023

Proximity ranking-based multimodal differential evolution.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Swarm Evol. Comput., 2023

Function value ranking aware differential evolution for global numerical optimization.

[BibT_eX]

[DOI]

,

,

,

,

,

Swarm Evol. Comput., 2023

Plane graphs of diameter two are 2-optimal.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2023

Star Chromatic Index of 1-Planar Graphs.

[BibT_eX]

[DOI]

,

,

,

Symmetry, 2022

Light edges in 1-planar graphs.

[BibT_eX]

[DOI]

Juan Liu

,

,

J. Graph Theory, 2022

Structure and pancyclicity of maximal planar graphs with diameter two.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Optim., 2022

Two sufficient conditions for a planar graph to be list vertex-2-arborable.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Strong Chromatic Index of Outerplanar Graphs.

[BibT_eX]

[DOI]

,

,

,

Axioms, 2022

IC-Planar Graphs Are 6-Choosable.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2021

Network vulnerability parameter and results on two surfaces.

[BibT_eX]

[DOI]

Wei Gao

,

Yaojun Chen

,

Int. J. Intell. Syst., 2021

Strict Neighbor-Distinguishing Index of Subcubic Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2021

Entire coloring of 2-connected plane graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2021

Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2020

Plane graphs with Δ =7 are entirely 10-colorable.

[BibT_eX]

[DOI]

Jiangxu Kong

,

,

J. Comb. Optim., 2020

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2020

An improved upper bound for the acyclic chromatic number of 1-planar graphs.

[BibT_eX]

[DOI]

Wanshun Yang

,

,

Discret. Appl. Math., 2020

Computation on the difference of Zagreb indices of maximal planar graphs with diameter two.

[BibT_eX]

[DOI]

,

Lina Zheng

Appl. Math. Comput., 2020

Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2019

Acyclic coloring of IC-planar graphs.

[BibT_eX]

[DOI]

Wanshun Yang

,

,

Discret. Math., 2019

Light structures in 1-planar graphs with an application to linear 2-arboricity.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2019

Star edge-coloring of graphs with maximum degree four.

[BibT_eX]

[DOI]

Ying Wang

,

,

Appl. Math. Comput., 2019

List coloring and diagonal coloring for plane graphs of diameter two.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2019

Planar graphs without chordal 5-cycles are 2-good.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2018

Strong chromatic index of K4-minor free graphs.

[BibT_eX]

[DOI]

,

Ping Wang

,

Inf. Process. Lett., 2018

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2018

A note on the list vertex arboricity of toroidal graphs.

[BibT_eX]

[DOI]

,

Min Chen

,

Discret. Math., 2018

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

[BibT_eX]

[DOI]

Jingjing Huo

,

,

Discret. Math., 2018

Edge-partition and star chromatic index.

[BibT_eX]

[DOI]

,

,

Ying Wang

Appl. Math. Comput., 2018

The entire chromatic number of graphs embedded on the torus with large maximum degree.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Miao Zhang

,

Min Chen

,

J. Comb. Optim., 2017

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

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2017

Neighbor-sum-distinguishing edge choosability of subcubic graphs.

[BibT_eX]

[DOI]

Jingjing Huo

,

,

J. Comb. Optim., 2017

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

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2017

On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2017

A note on the linear 2-arboricity of planar graphs.

[BibT_eX]

[DOI]

,

,

Wei-Fan Wang

Discret. Math., 2017

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

[BibT_eX]

,

,

Ars Comb., 2017

A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Glob. Optim., 2016

The entire choosability of plane graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2016

Plane graphs with maximum degree 9 are entirely 11-choosable.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

Some bounds on the neighbor-distinguishing index of graphs.

[BibT_eX]

[DOI]

,

Wei-Fan Wang

,

Jingjing Huo

Discret. Math., 2015

Equitable total-coloring of subcubic graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2015

Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.

[BibT_eX]

[DOI]

,

,

Wei-Fan Wang

SIAM J. Discret. Math., 2014

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2014

Plane graphs are entirely (δ + 5)-Choosable.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2014

The edge-face choosability of plane graphs with maximum degree at least 9.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2013

Acyclic edge coloring of planar graphs without 4-cycles.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2013

Linear Coloring of Planar Graphs Without 4-Cycles.

[BibT_eX]

[DOI]

,

Graphs Comb., 2013

A new upper bound on the acyclic chromatic indices of planar graphs.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2013

Acyclic list edge coloring of outerplanar graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2013

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2013

Acyclic edge coloring of planar graphs without 5-cycles.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2012

Every 4-regular graph is acyclically edge-6-colorable

[BibT_eX]

[DOI]

,

,

CoRR, 2012

Adjacent vertex-distinguishing edge colorings of K4-minor free graphs.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2011

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2010

Adjacent vertex distinguishing total colorings of outerplanar graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2010

L(p, q)-labelling of K4-minor free graphs.

[BibT_eX]

[DOI]

,