Notes on the twisted graph
From MaRDI portal
Recommendations
Cites work
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Graphs of non-crossing perfect matchings
- scientific article; zbMATH DE number 434700 (Why is no real title available?)
- scientific article; zbMATH DE number 1507305 (Why is no real title available?)
- Long alternating paths in bicolored point sets
- Reverse search for enumeration
- Simple alternating path problem
- Unavoidable configurations in complete topological graphs
Cited in
(8)- The crossing number of twisted graphs
- The biplanar tree graph
- Empty triangles in generalized twisted drawings of \(K_n\)
- Empty Triangles in Generalized Twisted Drawings of $K_n$
- Twisted ways to find plane structures in simple drawings of complete graphs
- Partitions of complete twisted graphs into plane spanning trees
- A note on maximal plane subgraphs of the complete twisted graph containing perfect matchings
- Some properties of the twisted Grassmann graphs
This page was built for publication: Notes on the twisted graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899270)