A note on the Nearly Dispersability of Odd Toroidal Grids
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929369683853312 |
|---|---|
| author | Yu, Xiaoxiang Shao, Zeling Li, Zhiguo |
| author_facet | Yu, Xiaoxiang Shao, Zeling Li, Zhiguo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_00585 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A note on the Nearly Dispersability of Odd Toroidal Grids Yu, Xiaoxiang Shao, Zeling Li, Zhiguo Combinatorics 05C10 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. |
| title | A note on the Nearly Dispersability of Odd Toroidal Grids |
| topic | Combinatorics 05C10 |
| url | https://arxiv.org/abs/2406.00585 |