A5q3,q4

"If G is not
connected, then we can add bridges between components on the outer face to create a
connected graph. We do not create cycles this way, so every cycle has length at least 6,
and we can apply the same upper bound on m."