Parallelism of stable traces

TL;DR

This paper provides a new combinatorial proof that Eulerian graphs with minimum degree greater than d are exactly those that admit parallel d-stable traces, which model self-assembling biotechnological processes.

Contribution

It offers an alternative, purely combinatorial proof of the characterization of graphs admitting parallel d-stable traces, previously established through other methods.

Findings

Graphs with minimum degree > d are exactly those with parallel d-stable traces.

Parallel d-stable traces model self-assembling polypeptide structures.

The paper confirms the equivalence using a new combinatorial approach.

Abstract

A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk enters $v$ from $X$, it also exits to a vertex in $X$. In the past, $d$-stable traces were investigated as a mathematical model for an innovative biotechnological procedure -- self-assembling of polypeptide structures. Among other, it was proven that graphs that admit parallel $d$-stable traces are precisely Eulerian graphs with minimum degree strictly larger than $d$. In the present paper we give an alternative, purely combinatorial proof of this result.