Hamiltonian sets of polygonal paths in assembly graphs

DOI10.1017/S0013091526101357MaRDI QIDQ7349966zbMATH OpenFDO

Authors Alexander Guterman, Nataşa Jonoska, E. M. Kreines, A. M. Maksaev, Natalia Ostroukhova

Publication date 17 September 2026

Published in Proceedings of the Edinburgh Mathematical Society. Series II (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0013091526101357

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Combinatorics on words (68R15)

Cites work

• DNA recombination through assembly graphs
• Double occurrence words: their graphs and matrices
• Four-regular graphs with rigid vertices associated to DNA recombination
• Genus ranges of 4-regular rigid vertex graphs
• scientific article; zbMATH DE number 16119 (Why is no real title available?)
• On representable graphs
• Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
• Patterns in permutations and words.
• RNA-guided DNA assembly
• Topological classification and enumeration of RNA structures by genus
• Virtual knot theory
• Word-representable graphs from a word's perspective
• Words and graphs

This page was built for publication: Hamiltonian sets of polygonal paths in assembly graphs

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