Pages that link to "Item:Q4912215"
From MaRDI portal
The following pages link to Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time (Q4912215):
Displaying 9 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- A linear-time algorithm for 7-coloring 1-plane graphs (Q818664) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)