Two Discrete Forms of the Jordan Curve Theorem

DOI10.2307/2323568MaRDI QIDQ3792700zbMATH OpenOpenAlexFDO

Authors Lawrence Neff Stout

Publication date 1988

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://digitalcommons.iwu.edu/math_scholarship/92

zbMATH Keywords

discrete linegraphsJordan curve theoremproduct path componentstight producttight product graphtight product path components

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Topological spaces of dimension (leq 1); curves, dendrites (54F50)

Recommendations

• Digital Jordan curves---a graph-theoretical approach to a topological theorem
• scientific article; zbMATH DE number 605346
• The complexity of proving the discrete Jordan curve theorem
• Convenient adjacencies for structuring the digital plane
• scientific article; zbMATH DE number 2079715

Cited in

(8)

• A duality for permutations
• Digital Jordan curves---a graph-theoretical approach to a topological theorem
• An elementary geometric nonstandard proof of the Jordan curve theorem
• A tutorial on well-composedness
• The complexity of proving the discrete Jordan curve theorem
• scientific article; zbMATH DE number 605346 (Why is no real title available?)
• On isoperimetrically optimal polyforms
• A survey of algebraic methods in digital topology.

This page was built for publication: Two Discrete Forms of the Jordan Curve Theorem

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