The following pages link to How many ways can one draw a graph? (Q879163):
Displaying 24 items.
- Improved enumeration of simple topological graphs (Q377494) (← links)
- The structure of almost all graphs in a hereditary property (Q631643) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- How unproportional must a graph be? (Q1663804) (← links)
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs (Q2039302) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- Complete graph drawings up to triangle mutations (Q2136833) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q2189736) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- Many touchings force many crossings (Q2312603) (← links)
- Ordered graphs and large bi-cliques in intersection graphs of curves (Q2323249) (← links)
- Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
- On String Graph Limits and the Structure of a Typical String Graph (Q2978181) (← links)
- (Q4537231) (← links)
- Many Touchings Force Many Crossings (Q4625108) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q5116528) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- Graph Drawing (Q5193166) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Topological drawings meet classical theorems from convex geometry (Q6074002) (← links)
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024 (Q6613406) (← links)
