Questionnaire-2024/smt/multiple_choice/3_1_smt_self.tex

\item \self In the following list tick all statements that are \texttt{true}.

\begin{itemize}
    \item[$\square$] An edge between two non-adjacent nodes $n_1$ and $n_2$ within a graph $G$ is called a chord.
    \item[$\square$] A graph is called chordal, if it contains no chord-free cycles with size greater than 2.
    \item[$\square$] A cycle is said to be chord-free, if in the cycle there exist no non-adjacent nodes that are connected by an edge.
    \item[$\square$] An edge between two non-adjacent nodes $n_1$ and $n_2$ within a graph $G$ is called a cycle.
\end{itemize}