11 citations · 15 across the 10 of their papers we have counts for
11 papers
1-planar graphs are odd 13-colorable
Runrun Liu, Weifan Wang, Gexin Yu
An odd coloring of a graph is a proper coloring such that any non-isolated vertex in has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by…
The strong chromatic index of 1-planar graphs
Yiqiao Wang, Ning Song, Jianfeng Wang +1
The chromatic index of a graph is the smallest for which admits an edge -coloring such that any two adjacent edges have distinct colors. The strong chromatic…
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.…