Galois connections between sets of paths and closure operators in simple graphs
From MaRDI portal
Publication:1738284
DOI10.1515/math-2018-0128zbMath1407.05070OpenAlexW2913195700WikidataQ128529821 ScholiaQ128529821MaRDI QIDQ1738284
Publication date: 29 March 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2018-0128
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph multiplication
- Boundaries in digital planes
- Computer graphics and connected topologies on finite ordered sets
- A digital analogue of the Jordan curve theorem
- Graphs with a path partition for structuring digital spaces
- Jordan Curve Theorems with Respect to Certain Pretopologies on $\mathbb Z^2$
- Convenient Closure Operators on $\mathbb Z^2$
- A Topological Approach to Digital Topology
- Combinatorial Image Analysis