diff --git a/chapters/connectors.tex b/chapters/connectors.tex
index 175a58127..2c5c4c931 100644
--- a/chapters/connectors.tex
+++ b/chapters/connectors.tex
@@ -915,7 +915,7 @@ \subsection{Generation of Connection Graph Equations}\label{generation-of-connec
 \item
   Instead of generating the equality-equation for an overdetermined component, a breakable branch in the virtual connection graph is constructed.
 \end{enumerate}
-If there are no redundant connect-equations the breakable branches can be chosen to correspond to the connect-equations for overdetermined connectors.
+If there are no redundant \lstinline!connect!-equations, the breakable branches can be chosen to correspond to the \lstinline!connect!-equations for overdetermined connectors.
 If there are redundant connect-equations there will always exist \lstinline!connect!-equations without a corresponding breakable branch
 
 Before connection equations are generated, the virtual connection graph is then transformed into a set of spanning trees by removing optional spanning tree edges from the graph.