Pages that link to "Item:Q1379820"
From MaRDI portal
The following pages link to Optimum embedding of complete graphs in books (Q1379820):
Displaying 17 items.
- Embedding generalized Petersen graph in books (Q295940) (← links)
- On the page number of complete odd-partite graphs (Q383683) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Embedding connected double-loop networks with even cardinality in books (Q1033043) (← links)
- Embedding the incomplete hypercube in books (Q1044693) (← links)
- A trade-off between page number and page width of book embeddings of graphs (Q1120583) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- (Q3691751) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- (Q4576348) (← links)
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine (Q4699162) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)