From a49bd69cf6d447cd9390b1da5b4257ef0072e05c Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Sat, 23 May 2020 23:37:43 +0200
Subject: [PATCH] Update model.tex

---
 Latex/model.tex | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/Latex/model.tex b/Latex/model.tex
index 03018c8..1e132f7 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. 
-- 
GitLab