Qiaojun Shu

According to our database, Qiaojun Shu authored at least 16 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Planar graphs are acyclically edge (Δ+ 5)-colorable.

Qiaojun Shu, Guohui Lin

CoRR, 2023

2021

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.

Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang

Theor. Comput. Sci., 2021

2020

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.

Qiaojun Shu, Guohui Lin, Eiji Miyano

CoRR, 2020

2017

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

Qiaojun Shu, Weifan Wang, Yiqiao Wang

J. Comb. Optim., 2017

2016

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable.

Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen

J. Comb. Optim., 2016

2015

(2, 1)-total labeling of trees with large maximum degree.

Dong Chen, Wai Chee Shiu, Qiaojun Shu, Pak Kiu Sun, Weifan Wang

Discret. Appl. Math., 2015

2014

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

Yiqiao Wang, Qiaojun Shu, Jian-Liang Wu, Wenwen Zhang

J. Comb. Optim., 2014

2013

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

Qiaojun Shu, Weifan Wang, Yiqiao Wang

J. Graph Theory, 2013

Acyclic edge coloring of planar graphs without 4-cycles.

Weifan Wang, Qiaojun Shu, Yiqiao Wang

J. Comb. Optim., 2013

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

Weifan Wang, Qiaojun Shu, Yiqiao Wang

Eur. J. Comb., 2013

Acyclic list edge coloring of outerplanar graphs.

Qiaojun Shu, Yiqiao Wang, Weifan Wang

Discret. Math., 2013

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

Yiqiao Wang, Qiaojun Shu, Weifan Wang

Discret. Appl. Math., 2013

2012

Acyclic chromatic indices of planar graphs with girth at least five.

Qiaojun Shu, Weifan Wang

J. Comb. Optim., 2012

Acyclic edge coloring of planar graphs without 5-cycles.

Qiaojun Shu, Weifan Wang, Yiqiao Wang

Discret. Appl. Math., 2012

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

Weifan Wang, Qiaojun Shu, Yiqiao Wang

CoRR, 2012

2011

Acyclic chromatic indices of planar graphs with large girth.

Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang

Discret. Appl. Math., 2011