A note on the Nearly Dispersability of Odd Toroidal Grids

The 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 dispersable if mbt(G)=Δ(G), nearly dispersable if mbt(G)=Δ(G)+1. Recently, the authors determined the nearly dispersability of odd toroidal grids Ts,t. In this note, we further present a brief proof for this result.