diff --git a/modules/ROOT/images/repeatable-elements-graph.svg b/modules/ROOT/images/repeatable-elements-graph.svg
index f85e06d7f..f3f02d4fb 100644
--- a/modules/ROOT/images/repeatable-elements-graph.svg
+++ b/modules/ROOT/images/repeatable-elements-graph.svg
@@ -1,48 +1,44 @@
diff --git a/modules/ROOT/pages/clauses/use.adoc b/modules/ROOT/pages/clauses/use.adoc
index 68799cdfd..69d43792d 100644
--- a/modules/ROOT/pages/clauses/use.adoc
+++ b/modules/ROOT/pages/clauses/use.adoc
@@ -73,8 +73,8 @@ In subqueries, a `USE` clause may appear directly following the xref:subqueries/
[source, cypher, role=test-setup]
----
CREATE DATABASE myDatabase;
-CREATE COMPOSITE DATABASE `myComposite`;
-CREATE ALIAS `myComposite`.`myConstituent` FOR DATABASE `myDatabase`;
+CREATE COMPOSITE DATABASE myComposite;
+CREATE ALIAS myComposite.myConstituent FOR DATABASE myDatabase;
----
////
diff --git a/modules/ROOT/pages/patterns/match-modes.adoc b/modules/ROOT/pages/patterns/match-modes.adoc
index 0385bd384..29b283bc6 100644
--- a/modules/ROOT/pages/patterns/match-modes.adoc
+++ b/modules/ROOT/pages/patterns/match-modes.adoc
@@ -181,11 +181,10 @@ The next example matches paths starting and ending at the same `Location` (`Knei
----
MATCH REPEATABLE ELEMENTS p = (start:Location {name: 'Kneiphof'})-[:BRIDGE]-{,9}(start) // <1>
WHERE all(bridge IN range(1,7) WHERE bridge IN [r IN relationships(p) | r.id]) // <2>
-WITH p
-ORDER BY length(p)
-LIMIT 1
RETURN [n IN nodes(p) | n.name] AS visitedLocations,
[r IN relationships(p) | r.id] AS crossedBridges
+ORDER BY length(p), crossedBridges
+LIMIT 1
----
<1> Paths with a length of less than 9 relationships return no results because they do not allow enough moves to traverse all seven bridges at least once while forming a cycle back to Kneiphof.
@@ -196,13 +195,13 @@ RETURN [n IN nodes(p) | n.name] AS visitedLocations,
|===
| visitedLocations | crossedBridges
-| ["Kneiphof", "South Bank", "Kneiphof", "South Bank", "Lomse", "Kneiphof", "North Bank", "Lomse", "North Bank", "Kneiphof"]
-| [4, 6, 4, 3, 7, 5, 2, 2, 1]
+| ["Kneiphof", "North Bank", "Kneiphof", "South Bank", "Lomse", "North Bank", "Kneiphof", "South Bank", "Lomse", "Kneiphof"]
+| [1, 1, 4, 3, 2, 5, 6, 3, 7]
2+d|Rows: 1
|===
-The order of the bridges traversed in the path returned demonstrates that bridges `2` and `4` were crossed twice in order to return to `Kneiphof`.
+The order of the bridges traversed in the path returned demonstrates that bridges `1` and `3` were crossed twice in order to return to `Kneiphof`.
image::repeatable-elements-graph.svg[Several graphs showing order of traversals when using repeatable elements match mode, width=600, role=popup]
_Sequence of bridge traversals when using `REPEATABLE ELEMENTS`._
diff --git a/modules/ROOT/pages/queries/composed-queries/sequential-queries.adoc b/modules/ROOT/pages/queries/composed-queries/sequential-queries.adoc
index 6a0f33ca0..72f714b05 100644
--- a/modules/ROOT/pages/queries/composed-queries/sequential-queries.adoc
+++ b/modules/ROOT/pages/queries/composed-queries/sequential-queries.adoc
@@ -65,7 +65,7 @@ CREATE (techCorp:Supplier {name: 'TechCorp', email: 'contact@techcorp.com'}),
== Syntax
.`NEXT` syntax
-[source, cypher]
+[source, syntax]
----