The pagenumber of toroidal graphs is at most seven (Q1377749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The pagenumber of toroidal graphs is at most seven |
scientific article; zbMATH DE number 1110014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The pagenumber of toroidal graphs is at most seven |
scientific article; zbMATH DE number 1110014 |
Statements
The pagenumber of toroidal graphs is at most seven (English)
0 references
26 January 1998
0 references
A book embedding of a graph is an ordering of its vertices along the spine of the book and an embedding of each edge of the graph on a single page, so that edges on the same page do not intersect. The author shows that every toroidal graph can be embedded in a book of 7 pages and conjectures that there is a toroidal graph needing 7 pages (so that the pagenumber of toroidal graphs would be 7).
0 references
book embedding
0 references
toroidal graph
0 references
pagenumber
0 references
0.81846666
0 references
0.8175845
0 references
0 references
0.8071013
0 references
0.8034948
0 references
0.8034006
0 references
0.80337954
0 references
