A combinatorial analog of the Jordan Curve Theorem
From MaRDI portal
Publication:1835918
DOI10.1016/0095-8956(83)90078-3zbMath0505.05003OpenAlexW2086537597MaRDI QIDQ1835918
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90078-3
Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (8)
An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps ⋮ A duality for permutations ⋮ Permutations and Riemann surfaces ⋮ Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof ⋮ Discrete Jordan curve theorems ⋮ Wrappings of Permutations ⋮ Counting orbits of a product of permutations ⋮ On the product of certain permutations
Cites Work
- How many ways can a permutation be factored into two n-cycles?
- Hypermaps versus bipartite maps
- Combinatorial Oriented Maps
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A combinatorial analog of the Jordan Curve Theorem
