Qiaojun Shu

activity

20122023

most citedEvery 4-regular graph is acyclically edge-6-colorable

4 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012★ 4 cited

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

Wang Weifan, Shu Qiaojun, Wang Yiqiao

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{'} (G)$ of $G$ is the smallest integer $…

math.CO2012

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

Weifan Wang, Qiaojun Shu, Yiqiao Wang

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{'} (G)$ of $G$ is the smallest integer $…