13 citations · 26 across the 9 of their papers we have counts for
10 papers
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…
The 3-rainbow index of a graph
Lily Chen, Xueliang Li, Kang Yang +1
Let be a nontrivial connected graph with an edge-coloring , where adjacent edges may be colored the same. A tree in $G…
Tricyclic graphs with maximal revised Szeged index
Lily Chen, Xueliang Li, Mengmeng Liu
The revised Szeged index of a graph is defined as where and are, respectively, the number of…
Further hardness results on the generalized connectivity of graphs
Lily Chen, Xueliang Li, Mengmeng Liu +1
The generalized -connectivity of a graph was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a na…
The (revised) Szeged index and the Wiener index of a nonbipartite graph
Lily Chen, Xueliang Li, Mengmeng Liu
Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index and the Wiener index , and between the revised Szeged index $S…
On a relation between the Szeged index and the Wiener index for bipartite graphs
Lily Chen, Xueliang Li, Mengmeng Liu
{\small The Wiener index of a graph is the sum of the distances between all pairs of vertices in the graph. The Szeged index of a graph is defined as $Sz(G)=…