Pages that link to "Item:Q2367407"
From MaRDI portal
The following pages link to Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407):
Displaying 5 items.
- The typenumber of trees (Q1613512) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs (Q1802068) (← links)
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine (Q4699162) (← links)
- Stack and queue number of 2-trees (Q6085708) (← links)