diff --git a/Documentation/Books/Users/General-Graphs/Functions.mdpp b/Documentation/Books/Users/General-Graphs/Functions.mdpp
index f9fa1b1da9..7977ea2fa0 100644
--- a/Documentation/Books/Users/General-Graphs/Functions.mdpp
+++ b/Documentation/Books/Users/General-Graphs/Functions.mdpp
@@ -1,6 +1,11 @@
 !CHAPTER Graph Functions
 
 This chapter describes various functions on a graph.
+A lot of these accept a vertex (or edge) example as parameter as defined in the next section.
+
+!SECTION Definition of examples
+
+@startDocuBlock JSF_general_graph_example_description
 
 !SECTION Get vertices from edges.
 
diff --git a/Documentation/Books/Users/General-Graphs/Management.mdpp b/Documentation/Books/Users/General-Graphs/Management.mdpp
index 6fb800f303..83b29cdb26 100644
--- a/Documentation/Books/Users/General-Graphs/Management.mdpp
+++ b/Documentation/Books/Users/General-Graphs/Management.mdpp
@@ -1,6 +1,6 @@
 !CHAPTER Graph Management
 
-In order to create a graph the philosophy of handling the graph content has to introduced.
+In order to create a graph the philosophy of handling the graph content has to be introduced.
 A graph contains a set of edge definitions each referring to one edge collection and
 defining constraints on the vertex collections used as start and end points of the edges.
 Furthermore a graph can contain an arbitrary amount of vertex collections, called  orphan collections, that are not used in any edge definition but should be managed by the graph.
@@ -28,7 +28,7 @@ The edge definitions for a graph is an Array containing arbitrary many directed
 
 !SUBSECTION Orphan Collections
 
-Each graph has an orphan collection. It consists of arbitrary many vertex collection (type *document*), that are not
+Each graph can have an arbitrary amount of orphan collections. These are vertex collections (type *document*), that are not
 used in an edge definition of the graph. If the graph is extended with an edge definition using one of the orphans,
 it will be removed from the orphan collection automatically.