2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/78198We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational tangles.9 Pages, 9 eps figuresGeometric TopologyQuantum Algebra57M25text