Pages that link to "Item:Q633211"

The following pages link to Simple realizability of complete abstract topological graphs in P (Q633211):

Displaying 20 items.

• Improved enumeration of simple topological graphs (Q377494) (← links)
• Recognition and complexity of point visibility graphs (Q512262) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← 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)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
• Polyline drawings with topological constraints (Q2290634) (← links)
• Empty triangles in good drawings of the complete graph (Q2345507) (← links)
• Topological Drawings of Complete Bipartite Graphs (Q2961537) (← links)
• Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
• On plane subgraphs of complete topological drawings (Q5156010) (← links)
• Bad drawings of small complete graphs (Q5206933) (← links)
• An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Induced Ramsey-type results and binary predicates for point sets (Q5915805) (← links)
• The Complexity of Angular Resolution (Q6075714) (← links)
• Rotation systems and simple drawings in surfaces (Q6574392) (← links)
• Different types of isomorphisms of drawings of complete multipartite graphs (Q6618247) (← links)