Pages that link to "Item:Q5897551"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897551):
Displaying 13 items.
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs (Q2039302) (← links)
- Complete graph drawings up to triangle mutations (Q2136833) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- Topological Drawings Meet Classical Theorems from Convex Geometry (Q5014123) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
- Enumeration of simple complete topological graphs (Q5902255) (← links)