... contain three edges — (x, x), (y, y)and(z, z) — from a single cycle Ci of F , the remaining edges coming from F−. The labeling of vertices in C can be madecanonical in the following ... (d +2)νn!ν!2νcompleting the proof of part (a) of Theorem 1. the electronic journal of combinatorics 7 (2000), #R57 5Part 2 of the lemma follows from the chain of inequalities1φ(k)≤1γ(k0)≤(β ... segment containing x, the segment containing x, and the remaining segment.Going round the cycle Ci, starting at xand ending at x, the vertices x, x,y,y,z,zmay appear in one of eight...