The following pages link to Minimal non-1-planar graphs (Q2470008):
Displaying 16 items.
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- 1-planarity of complete multipartite graphs (Q412349) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- Non-1-planarity of lexicographic products of graphs (Q2042623) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- 1-Planar Graphs (Q5001656) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- Maximal 1-plane graphs with dominating vertices (Q6096305) (← links)
