Combinatorial Oriented Maps
From MaRDI portal
Cited in
(15)- An additivity theorem for the genus of a graph
- Combinatorial maps
- Hypermap rewriting: A combinatorial approach
- Formalizing mathematics in higher-order logic: A case study in geometric modelling
- Tests and proofs for custom data generators
- A combinatorial analog of the Jordan Curve Theorem
- Formalizing the trading theorem in Coq
- Embedding of circulant graphs and generalized Petersen graphs on projective plane
- Tests and Proofs for Enumerative Combinatorics
- 0-1 laws for maps
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Discrete Jordan curve theorems
- On the average number of cycles in conjugacy class products
- An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This page was built for publication: Combinatorial Oriented Maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3855206)