diff --git a/journal/progress.md b/journal/progress.md
index 2f730463ed79a9d63bc77bc6245e7e691722b309..5ad48cf06d04dd1012147ee3b4697ee65719631d 100644
--- a/journal/progress.md
+++ b/journal/progress.md
@@ -45,6 +45,6 @@
 
 ## literature
 * I wrote following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
-** This paper references several other papers which deal with the topic. So I've also read the following _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets_. But they also used the vertex-separator constraints and a lazy approach. 
-** Their results quite good. So I guess it also makes sense to make some research how the graphs they used "looked like" and what characteristics they had that our graphs not have. 
+    - This paper references several other papers which deal with the topic. So I've also read the following _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets_. But they also used the vertex-separator constraints and a lazy approach. 
+    - Their results quite good. So I guess it also makes sense to make some research how the graphs they used "looked like" and what characteristics they had that our graphs not have.