Characterizing and recognizing twistedness
From MaRDI portal
Cites work
- Arrangements of pseudocircles: on digons and triangles
- Complete graph drawings up to triangle mutations
- Convex drawings of the complete graph: topology meets geometry
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Drawings of K_n with the same rotation scheme are the same up to Reidemeister moves (Gioan's theorem)
- Empty Triangles in Generalized Twisted Drawings of $K_n$
- Empty triangles in generalized twisted drawings of \(K_n\)
- Empty triangles in good drawings of the complete graph
- Flip graph connectivity for arrangements of pseudolines and pseudocircles
- Graph-Theoretic Concepts in Computer Science
- Holes in convex and simple drawings
- scientific article; zbMATH DE number 434700 (Why is no real title available?)
- Improved enumeration of simple topological graphs
- Levi's Lemma, pseudolinear drawings of , and empty triangles
- Plane Hamiltonian cycles in convex drawings
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- Simple realizability of complete abstract topological graphs simplified
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs
- Twisted ways to find plane structures in simple drawings of complete graphs
- Twisted ways to find plane structures in simple drawings of complete graphs
- Unavoidable configurations in complete topological graphs
- Unavoidable patterns in complete simple topological graphs
- Unavoidable patterns in complete simple topological graphs
This page was built for publication: Characterizing and recognizing twistedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354816)
