✦ LIBER ✦

The pagenumber of toroidal graphs is at most seven

✍ Scribed by Toshiki Endo

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 442 KB
Volume: 175
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00144-6

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we show that seven pages are sufficient for a book embedding of any toroidal graph.

📜 SIMILAR VOLUMES

The total chromatic number of any multig

The total chromatic number of any multigraph with maximum degree five is at most seven

✍ A.V. Kostochka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.

The rainbow connection of a graph is (at

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

✍ Michael Krivelevich; Raphael Yuster 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__

The trivalent symmetric graphs of girth

The trivalent symmetric graphs of girth at most six

✍ Robert C. Miller 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 864 KB

The Ramsey Number of an N-Edge Graph ver

The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1

✍ A.F. Sidorenko 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 334 KB

The linear arboricity of planar graphs o

The linear arboricity of planar graphs of maximum degree seven is four

✍ Jian-Liang Wu; Yu-Wen Wu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract The linear arboricity of a graph __G__ is the minimum number of linear forests which partition the edges of __G__. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph __G__. Wu wu prove

The chromaticity of complete bipartite g

The chromaticity of complete bipartite graphs with at most one edge deleted

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB 👁 1 views

## Abstract Let __K(p, q), p ≤ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ ≥ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del