In this paper we introduce the notion of t3t_3 \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path PP between two non-adjacent vertices in a graph GG is called t3t_3 \textit{path} if the first vertex of PP is among vertices from PP adjacent only to the second vertex of PP, and the last vertex of PP is among vertices from PP adjacent only to the second-last vertex of PP. A set SV(G)S \subseteq V(G) is