王艺桥

2026

不含相邻短圈和7-圈的平面图是（3,1）*-可选的

《应用数学学报》

2026

B‐Coloring of Planar Graphs

Journal of Graph Theory

DOI

2026

Edge-coloring of 2-degenerate graphs with induced-forest condition

Discrete Mathematics

DOI

2026

The 4‐degeneracy of Planar Graphs

Journal of Graph Theory

DOI

2025

不含4-圈和5-圈的平面图的2-距离列表染色

《数学学报(中文版)》

2025

Acyclic choosability of IC-planar graphs

Discrete Applied Mathematics

DOI

2025

On the Triple Arboricity of Graphs

Bulletin of the Malaysian Mathematical Sciences Society

DOI

2025

The 6-degeneracy of 1-planar graphs

Discrete Applied Mathematics

DOI

2025

Strict neighbor-distinguishing index of outerplanar graphs

Discrete Applied Mathematics

DOI

2024

A note on rainbow-free colorings of uniform hypergraphs

Discrete Applied Mathematics

DOI

2024

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

Discrete Mathematics

DOI

2024

Partitioning a planar graph without chordal 5-cycles into two forests

Czechoslovak Mathematical Journal

DOI

2024

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

Discrete Mathematics

DOI

2024

Acyclic Edge Coloring of 1-planar Graphs without 4-cycles

Acta Mathematicae Applicatae Sinica (English Series)

DOI

2023

不含相邻单圈的平面图是（3,1）*-可选的

《数学进展》

2023

Local Neighbor-Distinguishing Index of Graphs

Bulletin of the Malaysian Mathematical Sciences Society

DOI

2023

Coloring the square of maximal planar graphs with diameter two

Applied Mathematics and Computation

DOI

2023

Partitioning kite‐free planar graphs into two forests

Journal of Graph Theory

DOI

2023

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

Discrete Applied Mathematics

DOI

2023

On the order of antipodal covers

Journal of Graph Theory

DOI

2023

The Difference of Zagreb Indices of Halin Graphs

Axioms

DOI

2022

圈并三角形图的强边染色（英文）

《数学进展》

2022

不含4-圈和7-圈环面图（F,F3）-分解的存在性

《数学进展》

2022

平面图的严格邻点可区别染色

Scientia Sinica Mathematica

DOI

2022

Strict Neighbor-Distinguishing Total Index of Graphs

Acta Mathematica Sinica. English series

DOI

2022

Star Chromatic Index of 1-Planar Graphs

Symmetry

DOI

2022

Strong Chromatic Index of Outerplanar Graphs

Axioms

DOI

2022

Acyclic Chromatic Index of 1-Planar Graphs

Mathematics

DOI

2022

Linear Arboricity of 1-Planar Graphs

Discussiones Mathematicae Graph Theory

DOI

2022

The strong chromatic index of 1-planar graphs

Discrete Mathematics & Theoretical Computer Science

DOI

2022

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

Discrete Mathematics

DOI

2022

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

Symmetry

DOI

2022

Light edges in 1‐planar graphs

Journal of Graph Theory

DOI

2021

一类直径为2的极大平面图的Mostar指数

《应用数学学报》

2021

直径为2的可平面图的列表点荫度（英文）

《数学进展》

2021

Network vulnerability parameter and results on two surfaces

International Journal of Intelligent Systems

DOI

2021

The saturation number of C6

Discrete Mathematics

DOI

2021

Structure and pancyclicity of maximal planar graphs with diameter two

Journal of combinatorial optimization

DOI

2021

LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITH MAXIMUM DEGREE NINE

The Journal of Applied Analysis and Computation

DOI

2021

IC-Planar Graphs Are 6-Choosable

SIAM Journal on Discrete Mathematics

DOI

2021

On the Neighbor-Distinguishing Indices of Planar Graphs

Bulletin of the Malaysian Mathematical Sciences Society

DOI

2021

On critical graphs for the chromatic edge-stability number

Discrete Mathematics

DOI

2021

Entire coloring of 2-connected plane graphs

European journal of combinatorics (Print)

DOI

2020

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

Discrete Applied Mathematics

DOI

2020

2-Distance vertex-distinguishing edge colorings of graphs

2020

AN IMPROVED UPPER BOUND ON THE LINEAR 2-ARBORICITY OF TOROIDAL GRAPHS

Journal of Applied Analysis & Computation

DOI

2020

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

Applied Mathematics and Computation

DOI

2020

Plane graphs with Δ =7 are entirely 10-colorable

Journal of combinatorial optimization

DOI

2020

Strict Neighbor-Distinguishing Index of Subcubic Graphs

Graphs and Combinatorics

DOI

2020

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

Journal of Graph Theory

DOI

2020

An Improved Upper Bound on the Linear 2-arboricity of 1-planar Graphs

Acta Mathematica Sinica. English series

DOI

2019

最大度为7的哈林图的L(2,1)-标号

《华东师范大学学报(自然科学版)》

2019

List coloring and diagonal coloring for plane graphs of diameter two

Applied Mathematics and Computation

DOI

2019

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

Journal of combinatorial optimization

DOI

2019

Acyclic coloring of IC-planar graphs

Discrete Mathematics

DOI

2019

Acyclic Edge Coloring of 4-Regular Graphs (II)

DOI

2019

Acyclic Edge Coloring of 4-Regular Graphs Without 3-Cycles

DOI

2019

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

Discrete Applied Mathematics

DOI

2019

Star edge-coloring of graphs with maximum degree four

Applied Mathematics and Computation

DOI

2018

最大度为6的图的邻点可区别边色数

《应用数学学报》

2018

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

Journal of combinatorial optimization

DOI

2018

Edge-face coloring of 2-connected plane graphs

DOI

2018

Edge-partition and star chromatic index

Applied Mathematics and Computation

DOI

2018

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic

Graphs and Combinatorics

DOI

2018

Strong chromatic index of K4-minor free graphs

Information Processing Letters

DOI

2018

Linear 2-Arboricity of Toroidal Graphs

DOI

2018

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

Discrete Mathematics

DOI

2018

A note on the list vertex arboricity of toroidal graphs

Discrete Mathematics

DOI

2018

Planar graphs without chordal 5-cycles are 2-good

Journal of combinatorial optimization

DOI

2017

Edge coloring of graphs embedded in a surface of nonnegative characteristic

DOI

2017

A note on the linear 2-arboricity of planar graphs

Discrete Mathematics

DOI

2017

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

Theoretical Computer Science

DOI

2017

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

International Journal of Computational Mathematics

DOI

2017

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

Journal of combinatorial optimization

DOI

2017

Neighbor-sum-distinguishing edge choosability of subcubic graphs

Journal of combinatorial optimization

DOI

2017

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

Ars Comb.

2017

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

Journal of combinatorial optimization

DOI

2016

The entire choosability of plane graphs

Journal of combinatorial optimization

DOI

2016

An improved upper bound on the linear 2-arboricity of planar graphs

Discrete Mathematics

DOI

2016

Adjacent vertex distinguishing colorings by sum of sparse graphs

Discrete Mathematics

DOI

2016

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

Journal of combinatorial optimization

DOI

2016

Plane graphs with maximum degree 9 are entirely 11-choosable

Discrete Mathematics

DOI

2016

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

Journal of Global Optimization

DOI

2015

Equitable total-coloring of subcubic graphs

Discrete Applied Mathematics

DOI

2015

Some bounds on the neighbor-distinguishing index of graphs

Discrete Mathematics

DOI

2014

Plane graphs are entirely (δ + 5)-Choosable

Discret. Math. Algorithms Appl.

DOI

2014

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

SIAM Journal on Discrete Mathematics

DOI

2014

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

Discrete Mathematics

DOI

2014

Acyclic edge coloring of planar graphs without a 3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$3$$\end{document}-cy

Journal of combinatorial optimization

DOI

2013

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

Discrete Applied Mathematics

DOI

2013

Acyclic list edge coloring of outerplanar graphs

Discrete Mathematics

DOI

2013

Linear Coloring of Planar Graphs Without 4-Cycles

Graphs Comb.

DOI

2012

Acyclic edge coloring of planar graphs without 4-cycles

Journal of combinatorial optimization

DOI

2012

Acyclic edge coloring of planar graphs without 5-cycles

Discrete Applied Mathematics

DOI

2012

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

European journal of combinatorics (Print)

DOI

2012

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

arXiv.org

2011

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

Applied Mathematics Letters

DOI

2010

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

Journal of combinatorial optimization

DOI

2010

Adjacent vertex distinguishing total colorings of outerplanar graphs

Journal of combinatorial optimization

DOI

2008

ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE

DOI

2006

L ( p, q )-labelling of K 4 -minor free graphs

DOI

An identifying operation on a 1-planar graph with an application to acyclic coloring

Applied Mathematics and Computation

DOI

2026

Feedback-arc robustness in random orientations of pseudorandom triangle-free graphs

arXiv (Cornell University)

DOI

2026

Degeneracy bounds, stability, and a sharp gap for $B$-colorings

arXiv (Cornell University)

DOI

2026

1-Planar graphs without 6-cycles are 6-choosable

arXiv (Cornell University)

DOI

2024

On Coloring Problems

Springer eBooks

DOI