The following pages link to Zur Struktur 1‐planarer Graphen (Q3724362):
Displaying 25 items.
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- Optimal 1-planar graphs which triangulate other surfaces (Q1045136) (← links)
- Edge-pancyclicity of coupled graphs (Q1613351) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
- Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Minimal non-1-planar graphs (Q2470008) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- 1-Planar Graphs (Q5001656) (← links)
- AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES (Q5392879) (← links)
- Matchings in 1‐planar graphs with large minimum degree (Q6056806) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- Optimal 1-planar multigraphs (Q6172296) (← links)
- (Q6179340) (← links)
