Pages that link to "Item:Q1748996"
From MaRDI portal
The following pages link to Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996):
Displaying 4 items.
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
