Pages that link to "Item:Q1725735"
From MaRDI portal
The following pages link to Turning cliques into paths to achieve planarity (Q1725735):
Displaying 5 items.
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)