The following pages link to (Q5075803):
Displaying 8 items.
- Any maximal planar graph with only one separating triangle is Hamiltonian (Q1411340) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- 5-Connected Toroidal Graphs are Hamiltonian-Connected (Q3462548) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Universal geometric graphs (Q6632774) (← links)