2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/103760We prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.4 pages, 3 figuresGeometric Topology57M25; 57M27Replacing a graph clasper by tree clasperstext