A combinatorial analog of the Jordan Curve Theorem

DOI10.1016/0095-8956(83)90078-3MaRDI QIDQ1835918zbMATH OpenOpenAlexFDO

Authors Saul Stahl

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

zbMATH Keywords

genuspairs of permutationsplane embeddings of graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• Combinatorial Oriented Maps
• How many ways can a permutation be factored into two n-cycles?
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 3674124 (Why is no real title available?)
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3298598 (Why is no real title available?)
• scientific article; zbMATH DE number 3346357 (Why is no real title available?)
• scientific article; zbMATH DE number 3422404 (Why is no real title available?)
• Hypermaps versus bipartite maps
• Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
• Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings

Cited in

(9)

• A duality for permutations
• Counting orbits of a product of permutations
• On the product of certain permutations
• Wrappings of Permutations
• Discrete Jordan curve theorems
• Permutations and Riemann surfaces
• Pre-signed graphs: a reformulation of signed graphs and their embeddings
• 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: A combinatorial analog of the Jordan Curve Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835918)