Pages that link to "Item:Q1120583"
From MaRDI portal
The following pages link to A trade-off between page number and page width of book embeddings of graphs (Q1120583):
Displaying 8 items.
- The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- The pagewidth of trivalent planar graphs (Q2276971) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- (Q3691751) (← links)
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine (Q4699162) (← links)
- Three-bladed billiards (Q6653773) (← links)