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)=Δ(G)$, \emph{nearly dispersable} if $mbt(G)=Δ(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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。