Combinatorics of orientation reversing polygons
From MaRDI portal
Recommendations
Cites work
- 2-Matchings and 2-covers of hypergraphs
- A minimax theorem on circuits in projective graphs
- A sequence representation for maps
- Combinatorial maps
- Generalized Embedding Schemes
- Graph-encoded maps
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3912413 (Why is no real title available?)
- scientific article; zbMATH DE number 3544865 (Why is no real title available?)
- scientific article; zbMATH DE number 3579615 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
Cited in
(7)- Generalized thrackle drawings of non-bipartite graphs
- Generalized handles in graphs and connected sums of manifolds
- The largest parity demigenus of a simple graph
- Signed analogs of bipartite graphs
- Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions
- The order upper bound on parity embedding of a graph
- Pre-signed graphs: a reformulation of signed graphs and their embeddings
This page was built for publication: Combinatorics of orientation reversing polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075334)