I skimmed it, but couldn't find what the "doodle theorem" is. It's only mentioned in the title.
Quoting from the article:
> Claim: every doodle can be two-coloured.
Euler’s graph theorem.
Actually, no. That is mentioned, but it's not the theorem in question.
(2016)
... but timeless ...
[flagged]