9 citations · 22 across the 13 of their papers we have counts for
13 papers
The matching book embedding of the -sum of two graphs
Zeling Shao, Ruxing Sun, Zhiguo Li
The -sum is a new graph operation defined by combining four graph transformation operations with the Cartesian product operation. A matching book embedding of a graph is a b…
The degeneracy and Alon-Tarsi number under -sum operations
Zhiguo Li, Zhentao Jiao, Zeling Shao
The Alon-Tarsi number of a graph is the smallest such that there exists an orientation of with maximum outdegree satisfying that the number of eve…
The Alon-Tarsi Number of Cartesian product and Corona product of Hypercube Graph and Special Graphs
Zhiguo Li, Yujia Gai, Zeling Shao
The \emph{Alon-Tarsi number} of a graph is the smallest so that there exists an orientation of with max outdegree satisfying the number of even Eulerian subgr…
A note on the Nearly Dispersability of Odd Toroidal Grids
Xiaoxiang Yu, Zeling Shao, Zhiguo Li
The \emph{matching book thickness} of is the minimum integer such that an -page matching book embedding exists. A graph is called \emph{dispersable} if $mbt…
On the dispersability of graph bundles over cycles
Zeling Shao, Xiaoxiang Yu, Zhiguo Li
In this paper, the dispersability of the Cartesian graph bundle over two cycles is completely solved. We show the Cartesian graph bundle over two cycles is dispersable if i…
On the classification and dispersability of circulant graphs with two jump lengths
Xiaoxiang Yu, Zeling Shao, Zhiguo Li
In this paper, we give the classification of circulant graphs with and completely solve the dispersability of circulant graphs $C(\mathbb{Z}_{n},\{1,…
The Alon-Tarsi number of Halin graphs
Zhiguo Li, Qing Ye, Zeling Shao
The Alon-Tarsi number of a graph is the smallest for which there is an orientation of with max outdegree such that the number of Eulerian subgraphs of wit…
Bipartite cubic planar graphs are dispersable
Zeling Shao, Yanqing Liu, Zhiguo Li
The book embedding of a graph is to place the vertices of on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other. A bo…
Matching Book Thickness of Halin Graphs
Zeling Shao, Huiru Geng, Zhiguo Li
The \emph{matching book embedding} of a graph is to arrange its vertices on the spine, and draw its edges into the pages so that the edges on every page do not intersect each o…
The Matching Book Embedding of Biconnected Outerplanar Graphs
Zeling Shao, Yanqing Liu, Zhiguo Li
The - of a graph is an embedding of the graph in an -book with the vertices of on the spine and each edge to the pages without crossing each othe…
Embedding the Complete Expansion Graph in Books
Zeling Shao, Chunjin Ren, Zhiguo Li
A book embedding of a graph consists of an embedding of its vertices along the spine of a book, and an embedding of its edges on the pages such that edges embedded on the same page…
Matching Book Embedding of the Cartesian Product of a Complete Graph and a Cycle
Zeling Shao, Yanqing Liu, Zhiguo Li
The of a graph is to place the vertices of on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other.…
The Alon-Tarsi Number of A Toroidal Grid
Zhiguo Li, Zeling Shao, Fedor Petrov +1
The Alon-Tarsi number of a graph is the smallest for which there is an orientation of with max indegree such that the number of even and odd circulati…