4 citations · 4 across the 3 of their papers we have counts for
6 papers · 1 filter
Star coloring of sparse graphs
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier +2
A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number is t…
On the arithmetic-geometric index of graphs
Shu-Yu Cui, Weifan Wang, Gui-Xian Tian +1
Very recently, the first geometric-arithmetic index and arithmetic-geometric index were introduced in mathematical chemistry. In the present paper, we first obtain some l…
On -flow-critical graphs
Jiaao Li, Yulai Ma, Yongtang Shi +2
A bridgeless graph is called -flow-critical if it does not admit a nowhere-zero -flow, but has for any . Tutte's -flow conjecture can be equivalently…
DP-coloring for planar graphs of diameter two
Jingran Qi, Danjun Huang, Weifan Wang +1
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvourák and Postle (2017). Recently, Huang et al. [https://doi.org/10.1016/j.…
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…