11 citations · 13 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
DP-4-colorability of two classes of planar graphs
Lily Chen, Runrun Liu, Gexin Yu +2
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). In this paper, we prove that every planar…
math.CO2018
The strong chromatic index of -bipartite graphs
Mingfang Huang, Gexin Yu, Xiangqian Zhou
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. We study bipartite graphs with one part having maximum degree at most and…