On the public citation graph
�ber unendliche Wege in Graphen
0 signed · 202 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200005)34:1<67::aid-jgt7>3.0.co;2-vopenalex-snapshot
Geodetic rays and fibers in periodic graphs
inferred← citeshttps://doi.org/10.1002/1097-0118(200010)35:2<128::aid-jgt6>3.0.co;2-6openalex-snapshot
Miscellaneous problems on infinite graphs
inferred← citeshttps://doi.org/10.1002/jgt.10089openalex-snapshot
Planar embeddings with infinite faces
inferred← citeshttps://doi.org/10.1002/jgt.21916openalex-snapshot
On Small Separations in Cayley and Vertex Transitive Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22706openalex-snapshot
Duality theorems for stars and combs I: Arbitrary stars and combs
inferred← citeshttps://doi.org/10.1002/jgt.22781openalex-snapshot
Duality theorems for stars and combs III: Undominated combs
inferred← citeshttps://doi.org/10.1002/jgt.22813openalex-snapshot
End‐faithful spanning trees in graphs without normal spanning trees
inferred← citeshttps://doi.org/10.1002/jgt.23234openalex-snapshot
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190050202openalex-snapshot
On the reconstruction of locally finite trees
inferred← citeshttps://doi.org/10.1002/jgt.3190070408openalex-snapshot
On the notion of infinite Hamiltonian graph
inferred← citeshttps://doi.org/10.1002/malq.202400003openalex-snapshot
Paradoxical decompositions of free F2$F_2$‐sets and the Hahn‐Banach axiom
inferred← citeshttps://doi.org/10.1002/mana.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferred← citeshttps://doi.org/10.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1002/mana.19690410102openalex-snapshot
Wurzelbäume und unendliche Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19700440109openalex-snapshot
Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19821070124openalex-snapshot
Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
inferred← citeshttps://doi.org/10.1002/mana.19951740113openalex-snapshot
Decomposing Ends of Locally Finite Graphs
inferred← citeshttps://doi.org/10.1002/mana.200510587openalex-snapshot
Metric ends, fibers and automorphisms of graphs
inferred← citeshttps://doi.org/10.1002/mana.201800055openalex-snapshot
On tree‐decompositions of one‐ended graphs
inferred← citeshttps://doi.org/10.1002/mana.201800174openalex-snapshot
Ends, tangles and critical vertex sets
inferred← citeshttps://doi.org/10.1006/jctb.1993.1042openalex-snapshot
Vertex-Transitive Graphs and Accessibility
inferred← citeshttps://doi.org/10.1006/jctb.1996.0031openalex-snapshot
Geodesics in Transitive Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1996.1733openalex-snapshot
Geodetic Rays and Fibers in One-Ended Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_49openalex-snapshot
Automatic Graphs and Graph D0L-Systems
inferred← citeshttps://doi.org/10.1007/978-1-4899-2323-3_20openalex-snapshot
Random Walks on ω-Networks
inferred← citeshttps://doi.org/10.1007/978-1-4899-2323-3_21openalex-snapshot
Trees, Ends, and Transience
inferred← citeshttps://doi.org/10.1007/978-1-4899-2364-6_33openalex-snapshot
Behaviour at Infinity and Harmonic Functions of Random Walks on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-5936-3_4openalex-snapshot
Systeme Disjunkter Unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1007/978-3-658-24764-5_6openalex-snapshot
The language of self-avoiding walks
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_15openalex-snapshot
Ends of Infinite Graphs, Potential Theory and Electrical Networks
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_16openalex-snapshot
Topological Aspects of Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_17openalex-snapshot
Dendroids, End-Separators, and Almost Circuit-Connected Trees
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_19openalex-snapshot
Vertex-Transitive Graphs That Are Not Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_8openalex-snapshot
Three Remarks on End-Faithfulness
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_9openalex-snapshot
Ends and automorphisms of infinite graphs
inferred← citeshttps://doi.org/10.1007/978-94-017-7327-0_5openalex-snapshot
General and End Compactifications
inferred← citeshttps://doi.org/10.1007/bf01175130openalex-snapshot
Aspects topologiques de la s�paration dans les graphes infinis. I
inferred← citeshttps://doi.org/10.1007/bf01220026openalex-snapshot
Charakterisierung der Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1007/bf01236086openalex-snapshot
On vertex transitive graphs of infinite degree
inferred← citeshttps://doi.org/10.1007/bf01312552openalex-snapshot
The action of nilpotent groups on infinite graphs
inferred← citeshttps://doi.org/10.1007/bf01442875openalex-snapshot
Amenable group actions on infinite graphs
inferred← citeshttps://doi.org/10.1007/bf01788688openalex-snapshot
A note on bounded automorphisms of infinite graphs
inferred← citeshttps://doi.org/10.1007/bf01876629openalex-snapshot
On translations of double rays in graphs
inferred← citeshttps://doi.org/10.1007/bf02349960openalex-snapshot
Graphs with polynomial growth are covering graphs
inferred← citeshttps://doi.org/10.1007/bf02571256openalex-snapshot
Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
inferred← citeshttps://doi.org/10.1007/bf02572415openalex-snapshot
Fixed sets and free subgroups of groups acting on metric spaces
inferred← citeshttps://doi.org/10.1007/bf02579147openalex-snapshot
On automorphisms of infinite graphs with forbidden subgraphs
inferred← citeshttps://doi.org/10.1007/bf02764985openalex-snapshot
Boundaries of random walks on graphs and groups with infinitely many ends
inferred← citeshttps://doi.org/10.1007/bf02844721openalex-snapshot
On the hyperbolic limit points of groups acting on hyperbolic spaces
inferred← citeshttps://doi.org/10.1007/bf02925134openalex-snapshot
Harmonic functions on infinite graphs
inferred← citeshttps://doi.org/10.1007/bf02940823openalex-snapshot
Bilateral denseness of the hyperbolic limit points of groups acting on metric spaces
inferred← citeshttps://doi.org/10.1007/bf02940859openalex-snapshot
Translations and semi-translations in infinite graphs
inferred← citeshttps://doi.org/10.1007/bf02941538openalex-snapshot
A short proof of Halin’s grid theorem
inferred← citeshttps://doi.org/10.1007/bf02941627openalex-snapshot
On the Hadwiger number of infinite graphs
inferred← citeshttps://doi.org/10.1007/bf02942318openalex-snapshot
A refinement of Halin’s end-faithful spanning tree theorem
inferred← citeshttps://doi.org/10.1007/bf02992834openalex-snapshot
Automorphisms and endomorphisms of infinite locally finite graphs
inferred← citeshttps://doi.org/10.1007/bf02993589openalex-snapshot
A note on Menger's theorem for infinite locally finite graphs
inferred← citeshttps://doi.org/10.1007/bf02995910openalex-snapshot
Unendliche minimalen-fach zusammenhängende Graphen
inferred← citeshttps://doi.org/10.1007/bf02995937openalex-snapshot
A problem in infinite graph-theory
inferred← citeshttps://doi.org/10.1007/s00209-007-0190-8openalex-snapshot
Analogues of Cayley graphs for topological groups
inferred← citeshttps://doi.org/10.1007/s00209-014-1294-6openalex-snapshot
Ends of iterated function systems
inferred← citeshttps://doi.org/10.1007/s00220-014-2005-1openalex-snapshot
Entropy-Driven Phase Transition in Low-Temperature Antiferromagnetic Potts Models
inferred← citeshttps://doi.org/10.1007/s00493-004-0003-1openalex-snapshot
On a Problem of Cameron?s on Inexhaustible Graphs
inferred← citeshttps://doi.org/10.1007/s00493-010-2481-7openalex-snapshot
The homology of a locally finite graph with ends
inferred← citeshttps://doi.org/10.1007/s00493-015-3082-2openalex-snapshot
Spanning trees in hyperbolic graphs
inferred← citeshttps://doi.org/10.1007/s00493-018-3572-0openalex-snapshot
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
inferred← citeshttps://doi.org/10.1007/s00493-020-4184-zopenalex-snapshot
The Language of Self-Avoiding Walks
inferred← citeshttps://doi.org/10.1007/s00493-022-4987-1openalex-snapshot
Constructing Tree-Decompositions That Display All Topological Ends
inferred← citeshttps://doi.org/10.1007/s12188-008-0007-7openalex-snapshot
Free groups and ends of graphs
inferred← citeshttps://doi.org/10.1007/s12188-022-00259-1openalex-snapshot
A tree-of-tangles theorem for infinite tangles
inferred← citeshttps://doi.org/10.1007/s43036-020-00060-yopenalex-snapshot
KMS states, conformal measures and ends in digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90181-4openalex-snapshot
On a problem of R. Halin concerning infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90149-1openalex-snapshot
On a problem of R. Halin concerning infinite graphs II
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90292-8openalex-snapshot
Sous-graphes traçables des graphes infinis
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90151-2openalex-snapshot
A note on infinite transitive graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90138-0openalex-snapshot
A note on the growth of transitive graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90084-8openalex-snapshot
Simplicial decompositions of graphs: a survey of applications
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90120-qopenalex-snapshot
Groups acting on graphs with polynomial growth
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90332-vopenalex-snapshot
A survey on graphs with polynomial growth
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90333-wopenalex-snapshot
Some results on ends and automorphisms of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90341-xopenalex-snapshot
Asymmetrising sets in trees
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90342-yopenalex-snapshot
Asymmetrization of infinite trees
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90344-2openalex-snapshot
An end-faithful spanning tree counterexample
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90345-3openalex-snapshot
End-faithful forests and spanning trees in infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90348-6openalex-snapshot
Topological groups and infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90436-6openalex-snapshot
Tree-partitions of infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00525-vopenalex-snapshot
Minimax theorems for infinite graphs with the ends as ideal points
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00526-wopenalex-snapshot
Fixed elements of infinite trees
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00529-zopenalex-snapshot
Sur les graphes infinis possedant un groupe d'automorphismes primitif
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90039-iopenalex-snapshot
A minimax theorem for infinite graphs with ideal points
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90293-oopenalex-snapshot
Similarity and asymmetrization of trees
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90650-5openalex-snapshot
The end structure of a graph: recent results and open problems
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90332-nopenalex-snapshot
A decomposition of locally finite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00054-mopenalex-snapshot
Separating double rays in locally finite planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90378-6openalex-snapshot
On finite fixed sets in infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00044-wopenalex-snapshot
Finite invariant sets in infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90067-3openalex-snapshot
An edge-deletion problem for locally finite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90055-9openalex-snapshot
Infinite paths that contain only shortest paths
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90078-0openalex-snapshot
Nilpotent groups and transitive graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90094-9openalex-snapshot
Embeddings of infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90034-8openalex-snapshot
Graphs and groups with tree-like properties
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90040-qopenalex-snapshot
A mengerian theorem for infinite graphs with ideal points
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90064-qopenalex-snapshot
Properties of graphs with polynomial growth
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90022-popenalex-snapshot
On spanning trees and k-connectedness in infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90059-7openalex-snapshot
Infinite connected graphs with no end-preserving spanning trees
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90031-qopenalex-snapshot
Uniqueness of currents in infinite resistive networks
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.aim.2010.09.008openalex-snapshot
The fundamental group of a locally finite graph with ends
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.011openalex-snapshot
Transitive digraphs with more than one end
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.002openalex-snapshot
Two-ended regular median graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114724openalex-snapshot
Limits of cycles and cover conjectures
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.02.006openalex-snapshot
Highly arc transitive digraphs: reachability, topological groups
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.003openalex-snapshot
Reachability relations in digraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.042openalex-snapshot
Small separations in vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2003.10.005openalex-snapshot
A characterization of infinite planar primitive graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.01.004openalex-snapshot
Decompositions of infinite graphs: Part II circuit decompositions
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.06.008openalex-snapshot
Quasi-isometries between graphs and trees
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.10.006openalex-snapshot
End spaces of graphs are normal
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.08.005openalex-snapshot
Edge-disjoint double rays in infinite graphs: A Halin type result
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.07.004openalex-snapshot
Tangles and the Stone-Čech compactification of infinite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.04.002openalex-snapshot
Countably determined ends and graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.06.003openalex-snapshot
Connectoids I: A universal end space theory
inferred← citeshttps://doi.org/10.1016/j.jfa.2021.109216openalex-snapshot
A note on the Gaffney Laplacian on infinite metric graphs
inferred← citeshttps://doi.org/10.1016/j.jmaa.2026.130855openalex-snapshot
Form uniqueness for graphs with weakly spherically symmetric ends
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00867-1openalex-snapshot
Reconstruction of infinite locally finite connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00042-9openalex-snapshot
Spanning trees of countable graphs omitting sets of dominated ends
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00126-5openalex-snapshot
Minor-equivalence for infinite graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00065-5openalex-snapshot
Automatic graphs and D0L-sequences of finite graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00034-5openalex-snapshot
Graph-theoretical versus topological ends of graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70460-6openalex-snapshot
Some Problems and Results on Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70512-0openalex-snapshot
Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
inferred← citeshttps://doi.org/10.1016/s0195-6698(83)80032-8openalex-snapshot
Sur une Extension du Théorème de Menger aux Graphes Infinis
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80014-1openalex-snapshot
On the Representation of Triangulated Graphs in Trees
inferred← citeshttps://doi.org/10.1016/s0195-6698(89)80031-9openalex-snapshot
On the Action of Nilpotent and Metabelian Groups on Infinite, Locally Finite Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72823-8openalex-snapshot
On Automorphisms of Graphs with Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1017/cbo9780511629297.011openalex-snapshot
Groups acting on locally finite graphs - a survey of the infinitely ended case
inferred← citeshttps://doi.org/10.1017/fms.2025.22openalex-snapshot
Tree-like graphings, wallings, and median graphings of equivalence relations
inferred← citeshttps://doi.org/10.1017/s0013091500037640openalex-snapshot
Harmonic functions and ends of graphs
inferred← citeshttps://doi.org/10.1017/s0305004100068742openalex-snapshot
On end-faithful spanning trees in infinite graphs
inferred← citeshttps://doi.org/10.1017/s0305004126101996openalex-snapshot
A representation theorem for end spaces of infinite graphs
inferred← citeshttps://doi.org/10.1017/s096354830000081xopenalex-snapshot
Minimization Problems for Infiniten-Connected Graphs
inferred← citeshttps://doi.org/10.1023/a:1004371421758openalex-snapshot
Finite Invariant Sets for a Family of Endomorphisms in Compact Graphs
inferred← citeshttps://doi.org/10.1023/a:1013723720265openalex-snapshot
Multi-Faithful Spanning Trees of Infinite Graphs
inferred← citeshttps://doi.org/10.1023/a:1013797519839openalex-snapshot
End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays
inferred← citeshttps://doi.org/10.1063/5.0163052openalex-snapshot
Uncovering the geometry of protein interaction network: The case of SARS-CoV-2 protein interactome
inferred← citeshttps://doi.org/10.1090/proc/17532openalex-snapshot
A metrization theorem for edge-end spaces of infinite graphs
inferred← citeshttps://doi.org/10.1090/s0002-9939-1989-0973847-6openalex-snapshot
Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9939-1991-1045600-8openalex-snapshot
An end-faithful spanning tree counterexample
inferred← citeshttps://doi.org/10.1090/s0002-9947-1993-1079058-6openalex-snapshot
Excluding Infinite Trees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1993-1102885-3openalex-snapshot
Martin and end compactifications for non-locally finite graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-99-02228-xopenalex-snapshot
Operating points in infinite nonlinear networks approximated by finite networks
inferred← citeshttps://doi.org/10.1090/s0002-9947-99-02255-2openalex-snapshot
On graphs with a metric end space
inferred← citeshttps://doi.org/10.1112/blms/26.1.1openalex-snapshot
Random Walks on Infinite Graphs and Groups - a Survey on Selected topics
inferred← citeshttps://doi.org/10.1112/jlms.12539openalex-snapshot
Self‐adjoint and Markovian extensions of infinite quantum graphs
inferred← citeshttps://doi.org/10.1137/100783686openalex-snapshot
Ends and Vertices of Small Degree in Infinite Minimally k -(Edge)-Connected Graphs
inferred← citeshttps://doi.org/10.1142/s0219498821500390openalex-snapshot
Intersection graphs of general linear groups
inferred← citeshttps://doi.org/10.1142/s1793830922500239openalex-snapshot
Two-ended quasi-transitive graphs
inferred← citeshttps://doi.org/10.1145/3392153openalex-snapshot
Stability and Scalability of Blockchain Systems
inferred← citeshttps://doi.org/10.1145/3393691.3394218openalex-snapshot
Stability and Scalability of Blockchain Systems
inferred← citeshttps://doi.org/10.1177/22113568251359095openalex-snapshot
Infinite Eulerian paths are computable on graphs with vertices of infinite degree
inferred← citeshttps://doi.org/10.1214/22-aihp1344openalex-snapshot
Limit distributions of branching Markov chains
inferred← citeshttps://doi.org/10.1214/23-aap2032openalex-snapshot
Invasion percolation on power-law branching processes
inferred← citeshttps://doi.org/10.1214/24-ejp1082openalex-snapshot
Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
inferred← citeshttps://doi.org/10.1287/stsy.2023.0045openalex-snapshot
Almost Sure One-Endedness of a Random Graph Model of Distributed Ledgers
inferred← citeshttps://doi.org/10.26493/1855-3974.334.fe4openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.3217/ajbmw-c3n91openalex-snapshot
Lamplighter Random Walks and Entropy-Sensitivity of Languages
inferred← citeshttps://doi.org/10.3217/dn02h-wn926openalex-snapshot
< > line graph of every locally finite 6-edge-connected graph with finitely many ends is Hamiltonian
inferred← citeshttps://doi.org/10.37236/115openalex-snapshot
Reachability Relations and the Structure of Transitive Digraphs
inferred← citeshttps://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferred← citeshttps://doi.org/10.4115/jla.2014.6.7openalex-snapshot
End compactifications and general compactifications
inferred← citeshttps://doi.org/10.4171/ggd/439openalex-snapshot
The domino problem on groups of polynomial growth
inferred← citeshttps://doi.org/10.48550/arxiv.0910.5605openalex-snapshot
Spanning trees in hyperbolic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0910.5634openalex-snapshot
On the homology of locally finite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1008.3062openalex-snapshot
Graphs, permutations and topological groups
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1970openalex-snapshot
On Small Separations in Cayley Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4222openalex-snapshot
The domino problem on groups of polynomial growth
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4372openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1516openalex-snapshot
Ends of iterated function systems
inferred← citeshttps://doi.org/10.48550/arxiv.1708.03476openalex-snapshot
From cycles to circles in Cayley graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.03295openalex-snapshot
Ends of digraphs I: basic theory
inferred← citeshttps://doi.org/10.48550/arxiv.2011.00145openalex-snapshot
Metric Graphs with Totally Disconnected Boundary
inferred← citeshttps://doi.org/10.5486/pmd.2016.7470openalex-snapshot
On the reduction of binary quadratic forms
inferred← citeshttps://doi.org/10.5802/ahl.139openalex-snapshot
Triangulations of uniform subquadratic growth are quasi-trees
inferred← citeshttps://doi.org/10.70675/227b8686z1ee0z4156za2a9zc0590b828670openalex-snapshot
Subshifts of Finite Type on Groups : Emptiness and Aperiodicity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.