Walks, Paths and Connectivity · Hard problem

A graph consists of three connected components, each a cycle with no chords and no vertices shared with the others. Together they have $18$ vertices. The longest cycle has twice as many vertices as the shortest, and the third cycle has exactly $2$ more vertices than the shortest. How many vertices does the longest cycle have?