Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.
Journal of Pure and Applied Algebra , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.
citing papers explorer
-
Relative accessibility for graphs
Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.
-
Almost planar finitely presented groups
Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.