The Language of Self-Avoiding Walks

DOI10.1007/978-3-658-24764-5MaRDI QIDQ4646307zbMATH OpenOpenAlexFDO

Authors Christian Lindorfer

Publication date 11 January 2019

Published in BestMasters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-658-24764-5

zbMATH Keywords

edge-labelled graphsformal language of self-avoiding walksinfinite ladder-graphsandwich of two regular infinite trees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Infinite graphs (05C63) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Self-avoiding walks and connective constants
• scientific article; zbMATH DE number 6456216
• Self-avoiding walk on nonunimodular transitive graphs
• Bounds on the self-avoiding-walk connective constant
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• New upper bounds for the connective constants of self-avoiding walks
• Self-avoiding walks on finite graphs of large girth
• New lower bounds on the self-avoiding-walk connective constant
• Self-Avoiding Walks on Hyperbolic Graphs
• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices

Cited in

(7)

• Cubic graphs and the golden mean
• Self-avoiding walks and multiple context-free languages
• Bounds on connective constants of regular graphs
• Self-avoiding walks and their languages
• Counting self-avoiding walks on free products of graphs
• Extendable self-avoiding walks
• The language of self-avoiding walks

This page was built for publication: The Language of Self-Avoiding Walks

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