Search

The \emph{matching book thickness} $mbt(G)$ of $G$ is the minimum integer $m$ such that an $m$-page matching book embedding exists. A graph $G$ is called \emph{dispersable} if $mbt(G)=\Delta(G)$, \emph{nearly dispersable} if $mbt(G)=\Delta(G)+1$. Recently, the authors determined the nearly dispersability of odd toroidal grids $T_{s,t}$. In this note, we further present a brief proof for this result.

In this paper, the dispersability of the Cartesian graph bundle over two cycles is completely solved. We show the Cartesian graph bundle $G$ over two cycles is dispersable if $G$ is bipartite; otherwise, $G$ is nearly dispersable., Comment: arXiv admin note: text overlap with arXiv:2310.06612

In this paper, we give the classification of circulant graphs $C(\mathbb{Z}_{n},S)$ with $|S|=2$ and completely solve the dispersability of circulant graphs $C(\mathbb{Z}_{n},\{1, k\})$.

The Alon-Tarsi number of a graph $G$ is the smallest $k$ for which there is an orientation $D$ of $G$ with max outdegree $k-1$ such that the number of Eulerian subgraphs of $G$ with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges. In this paper, we obtain the Alon-Tarsi number of a Halin graph equals 4 when it is a wheel of even order and 3 otherwise.

The book embedding of a graph $G$ is to place the vertices of $G$ 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 book embedding is matching if the vertices in the same page have maximum degree at most 1. The matching book thickness is the minimum number of pages in which a graph can be matching book embedded. A graph $G$ is dispersable if and only if $mbt(G)=\Delta(G)$. In this paper, we prove that bipartite cubic planar graphs are dispersable.

The $n$-$book ~embedding$ of a graph $G$ is an embedding of the graph $G$ in an $n$-book with the vertices of $G$ on the spine and each edge to the pages without crossing each other. If the degree of vertices of $G$ at most one in each page, the $n$-book embedding is $matching$. The $matching~ book~ thickness$ of graph $G$ is the smallest $n$ so that $G$ can be matching embedded in an $n$-book. In this paper, the matching book thickness of the biconnected outerplanar graphs is determined., Comment: There is one very easy method to prove this result

The \emph{matching book embedding} of a graph $G$ 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 other and the maximum degree of vertices on every page is one. The \emph{matching book thickness} is the minimum number of pages in which the graph $G$ can be matching embedded. In this paper, the matching book thickness of Halin graphs is determined., Comment: The proof in the manuscripts can be simplified

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 do not intersect. The pagenumber is the minimum number of pages in which the graph $G$ can be embedded. The main purpose of this paper is to study the book embedding of the complete expansion graph. This is the first work about it, and some exact pagenumbers of the complete expansion graphs of some special graphs are obtained.

The $book$ $embedding$ of a graph $G$ is to place the vertices of $G$ 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 book embedding is $matching$ if the pages have maximum degree $1$. The $matching$ $book$ $thickness$ is the minimum number of pages in which graphs can be matching book embedded. In this paper, we show that the matching book thickness of the Cartesian product $K_p\Box C_q$of a complete graph $K_p$ and a cycle $C_q$ is equal to $\Delta(K_p\Box C_q)+1$.

The Alon-Tarsi number $AT(G)$ of a graph $G$ is the smallest $k$ for which there is an orientation $D$ of $G$ with max indegree $k-1$ such that the number of even and odd circulations contained in D are different. In this paper, we show that the Alon--Tarsi number of toroidal grids $T_{m,n}=C_m\Box C_n$ equals $4$ when $m,n$ are both odd and $3$ otherwise.