Discrete Jordan curve theorems

DOI10.1016/0095-8956(89)90027-0MaRDI QIDQ580354zbMATH OpenOpenAlexFDO

Authors Andrew Vince, C. 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

cycle double coversdualityEuler characteristicgraph embeddingsgraph theoretic versionsJordan Curve Theorem

Mathematics Subject Classification ID

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

Review text

Short proofs of three graph theoretic versions of the Jordan Curve Theorem are given.

Cites work

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

Cited in

(9)

• A duality for permutations
• A characterization of embeddability of graphs on surfaces
• A crossing lemma for Jordan curves
• Chromatic number, induced cycles, and non-separating cycles
• Binary topological relations on the digital sphere
• A Jordan Curve Theorem in the Digital Plane
• scientific article; zbMATH DE number 4211535 (Why is no real title available?)
• An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
• Non-separating cycles and discrete Jordan curves

This page was built for publication: Discrete Jordan curve theorems

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