I presented a talk titled "Varkony Reconsidered: Subgraph enumeration and the Multiple MCS problem" at the 6th Joint Sheffield Conference on Chemoinformatics on 23 July 2013.The major goal of the presentation was to show how the 1979 paper of Varkony, which is part of the MCS literature, is better seen as an early paper in frequent subgraph mining. My own MCS algorithm, fmcs, is a variation of that approach, and is best seen as an intellectual descendent of an algorithm by Takahashi. Both the Varkony and Takahashi papers are relatively uncited in the MCS literature, so I spend some time explaining how they fit into the larger context. The full MCS talk is on my web site. This is the place to leave comments.