Infinite paths that contain only shortest paths
From MaRDI portal
Publication:1076039
DOI10.1016/0095-8956(86)90055-9zbMath0593.05045OpenAlexW1988198963MaRDI QIDQ1076039
Publication date: 1986
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(86)90055-9
Related Items
Percolation and isoperimetry on roughly transitive graphs ⋮ Geodetic rays and fibers in one-ended planar graphs ⋮ Separating double rays in locally finite planar graphs ⋮ Geometry of nontransitive graphs ⋮ On end-faithful spanning trees in infinite graphs ⋮ Ends of graphs. II ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls ⋮ Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\) ⋮ Critical exponents for a percolation model on transient graphs ⋮ Unnamed Item ⋮ Extendable self-avoiding walks ⋮ A survey on graphs with polynomial growth ⋮ Unnamed Item ⋮ Imaginary cone and reflection subgroups of Coxeter groups ⋮ Percolation and local isoperimetric inequalities ⋮ On translations of double rays in graphs ⋮ Fixed sets and free subgroups of groups acting on metric spaces
Cites Work
