Parallelism of stable traces

DOI10.26493/2590-9770.1251.b76zbMath1421.05060arXiv1612.08474OpenAlexW3099235222MaRDI QIDQ5198033

Jernej Rus

Publication date: 2 October 2019

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Eulerian graphpolypeptideself-assemblingnanostructure designparallel \(d\)-stable trace

Mathematics Subject Classification ID

Applications of graph theory (05C90) Kinetics in biochemical problems (pharmacokinetics, enzyme kinetics, etc.) (92C45) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• Strong Traces Model of Self-Assembly Polypeptide Structures
• An algebraic approach to enumerating non-equivalent double traces in graphs

This page was built for publication: Parallelism of stable traces