Name
Abstract | ||
|---|---|---|
In this paper we describe for any n ≥ 3 a family of graphs possessing a book embedding using n pages—but only with unbounded page width. However, if one uses one additional page, then the page width can be kept bounded by a constant. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0890-5401(88)90036-3 | Inf. Comput. |
Keywords | Field | DocType |
book embeddings,page number,page width,book embedding | Graph theory,Discrete mathematics,Graph,Combinatorics,Circuit design,Fault tolerance,Book embedding,Integrated circuit,Mathematics,Planar graph,Bounded function | Journal |
Volume | Issue | ISSN |
79 | 2 | Information and Computation |
Citations | PageRank | References |
3 | 0.61 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Stöhr | 1 | 64 | 9.52 |