Antiparallel \(d\)-stable traces and a stronger version of ore problem

DOI10.1007/s00285-016-1077-2zbMath1368.05025arXiv1403.5806OpenAlexW2517444966WikidataQ48932237 ScholiaQ48932237MaRDI QIDQ2014350

Jernej Rus

Publication date: 11 August 2017

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

spanning treestrands of DNAself-assembling\(d\)-stable tracedouble tracepolypeptide nanostructuresingle face embeddingstrong trace

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15) General biology and biomathematics (92B05)

Related Items

Deriving graphs with a retracting-free bidirectional double tracing ⋮ Parallelism of stable traces ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bidirectional retracting-free double tracings and upper embeddability of graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• Doubly traversed Euler circuits
• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• Bounds of the number of disjoint spanning trees
• A problem regarding the tracing of graphs
• Strong Traces Model of Self-Assembly Polypeptide Structures
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• Oriented walk double covering and bidirectional double tracing
• On the surface duality of linear graphs
• ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
• On Traversing Graphs