Discrete Jordan curve theorems

DOI10.1016/0095-8956(89)90027-0zbMath0626.05016OpenAlexW2049144249MaRDI QIDQ580354

Andrew Vince, Charles H. C. Little

Publication date: 1989

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(89)90027-0

zbMATH Keywords

dualityEuler characteristicgraph embeddingscycle double coversgraph theoretic versionsJordan Curve Theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps ⋮ A duality for permutations ⋮ A characterization of embeddability of graphs on surfaces ⋮ Non-separating cycles and discrete Jordan curves ⋮ Chromatic number, induced cycles, and non-separating cycles ⋮ Binary topological relations on the digital sphere

Cites Work

• Crystallisation moves
• Cubic combinatorial maps
• Graph-encoded maps
• Combinatorial maps
• A combinatorial analog of the Jordan Curve Theorem
• Combinatorial Oriented Maps
• Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings

This page was built for publication: Discrete Jordan curve theorems