diff --git a/Latex/model.tex b/Latex/model.tex
index 03018c847f091ad0b9320c3f36901e34d2987193..1e132f741f7929e36f3a8b1600b8545be5e83eff 100644
--- a/Latex/model.tex
+++ b/Latex/model.tex
@@ -30,6 +30,3 @@ Exponential number as shown in ... $O(3^{n/3})$
 
 \subsection{Hardness}
 Connected k hop dominating set is NP-Hard on general Graphs. It is proven to be solvable in polynomial time on some specific graphs.\\
-It is proven to be NP-Hard on planar bipartite Graphs with maximum degree 4.\\
-The Connected k hop dominating set with k = 1 is NP-Hard on all planar bipartite graphs. \\
-As all of our graphs are planar and bipartite in the case of k = 1 finding an optimal solution is NP-Hard.