Proteins fold into three-dimensional structures stabilized by intramolecular bridges — disulfide bonds that link distant parts of the chain. The topology of a closed protein chain with such bridges is not captured by classical knot theory: the bridges create additional constraints that standard knot invariants ignore. Bonded knots model this situation: knots with prescribed internal connections between strands.
This paper systematically classifies uncolored bonded knots with singularity number up to seven. The procedure generates all possible planar graphs, converts them into bonded knot diagrams, then uses the Yamada polynomial and brute-force Reidemeister moves to distinguish topological types.
Note (2026-11-09): The abstract (Gabrovsek, Simonic and Niemyska) presents a systematic classification procedure for uncolored bonded knots with singularity number at most seven, generating planar graphs, converting them to bonded knot diagrams, and using the Yamada polynomial together with brute-force Reidemeister moves to distinguish knot types. It does not say this is the first complete tabulation, that the Yamada polynomial alone separates the types (the abstract pairs it with Reidemeister moves), or that the entries correspond to distinct ways a protein backbone threads through space; the abstract does not describe the singularity number as a count of 'bond crossings'.
The classification is the first complete tabulation for bonded knots in this range, following the century-old tradition of knot tables but in a richer structure. Each entry in the table corresponds to a topologically distinct way a protein backbone can thread through space while maintaining a specific pattern of intramolecular bonds. The table is finite: with seven or fewer bond crossings, there are a catalogueable number of distinct topologies. The Yamada polynomial — designed for spatial graphs, not just knots — provides the invariant strong enough to separate them.