11 citations · 15 across the 10 of their papers we have counts for
4 papers · 1 filter
Every 4-regular graph is acyclically edge-6-colorable
Wang Weifan, Shu Qiaojun, Wang Yiqiao
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimu…
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 is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…
Full Orientability of the Square of a Cycle
Fengwei Xu, Weifan Wang, Ko-Wei Lih
Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. De…