25 citations · 45 across the 17 of their papers we have counts for
18 papers
The maximum number of two 4-vertex graphs in planar graphs
Wei Liu, Lin Sun, Jianliang Wu
Let be the maximum number of copies of a graph in a planar graph of order . When is a connected graph on four vertices, has been completely determined…
The generation and regulation of public opinion on multiplex social networks
Zhong Zhang, Jian-liang Wu, Cun-quan Qu +1
The dissemination of information and the development of public opinion are essential elements of most social media platforms and are often described as distinct, man-made occurrenc…
-choosability of planar graphs with -cycles far apart via the Combinatorial Nullstellensatz
Fan Yang, Yue Wang, Jian-liang Wu
By a well-known theorem of Thomassen and a planar graph depicted by Voigt, we know that every planar graph is -choosable, and the bound is tight. In 1999, Lam, Xu and Liu reduce…
A note on the edge choosability of -minor free graphs
Jieru Feng, Jianliang Wu, Fan Yang
For a planar graph , Borodin stated that is -edge-choosable if and later Bonamy showed that is -edge-choosable if . At the same time, Borodin et…
The total coloring of -minor-free graphs
Fan Yang, Jianliang Wu
A total -coloring of a graph is a coloring of using colors such that no two adjacent or incident elements receive the same color. The total chromatic num…
Toward Structural Controllability and Predictability in Directed Networks
Fei Jing, Chuang Liu, Jian-Liang Wu +1
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structura…