MathCastle
Graph TheoryMediumWalks, Paths and Connectivity

Walks, Paths and Connectivity · Medium problem

A 66-cycle 1-2-3-4-5-6-11\text{-}2\text{-}3\text{-}4\text{-}5\text{-}6\text{-}1 has an extra chain of vertices 7,8,97,8,9 hanging off vertex 11 (edges 12,23,34,45,56,61,17,78,8912,23,34,45,56,61,17,78,89). If the bridge 8989 is removed, what are the sizes of the two resulting pieces? Give the smaller one.