Pages that link to "Item:Q1304472"
From MaRDI portal
The following pages link to Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472):
Displaying 10 items.
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS (Q5493895) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
