2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/144911We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.13 pages, 14 figuresCombinatorics05C10text