2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/74736We have conjectured that the constraint equations defined by a generic Laman graph are not soluble by radicals when the graph is 3-connected. We prove that this conjecture follows from the following simpler conjecture: the constraint equations defined by a generic Laman graph are not soluble by radicals if the graph does not contain a proper subgraph which is itself a Laman graph.14 pages, 5 figuresCombinatorics68U07, 12F10, 05C40 (primary), 52C25, 13P99 (secondary)text