The following pages link to (Q5688095):
Displaying 8 items.
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- Improved lower bounds on book crossing numbers of complete graphs (Q2848524) (← links)
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine (Q4699162) (← links)
- One- and two-page crossing numbers for some types of graphs (Q5747710) (← links)
- On book crossing numbers of the complete graph (Q6552472) (← links)
