Enumeration of planar Tangles

DOI10.1007/s12044-020-00575-7zbMath1447.05052arXiv1906.01541OpenAlexW3048580718MaRDI QIDQ2197116

Douglas A. Torrance

Publication date: 4 September 2020

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.01541

zbMATH Keywords

polyominotangledual graphgrowth constant

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Polyominoes (05B50)

Related Items (1)

tanglenum

Uses Software

• NetworkX
• OEIS
• Python

Cites Work

• Unnamed Item
• Counting polyominoes: yet another attack
• Punctured polygons and polyominoes on the square lattice
• The Mathematics of Various Entertaining Subjects
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
• Cell Growth Problems
• An algorithm for finding a fundamental set of cycles of a graph

This page was built for publication: Enumeration of planar Tangles