From 0bedb03c6f7401f75ff9c7a9b462c65659d97846 Mon Sep 17 00:00:00 2001
From: Robin Clark <r.clark@energytechnologycontrol.com>
Date: Tue, 17 Aug 2010 15:37:43 +0100
Subject: [PATCH] .

---
 eulerg/eulerg.tex | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/eulerg/eulerg.tex b/eulerg/eulerg.tex
index c7acdc7..d0c56d3 100644
--- a/eulerg/eulerg.tex
+++ b/eulerg/eulerg.tex
@@ -149,10 +149,12 @@ The diagram in figure \ref{fig:eulerg_enc} can now be represented as a graph thu
 
 \pagebreak[0]
 \section{The {\pic}}
-
+In graph theory a node is said to be reachable from another node
+if you can start at the one node, travel via the edges
+and arrive at the other. 
 Contours may be connected via `pure intersection' relationships to form 
 `chains' of contours reachable by pure intersection.
-
+These are termed {\pic}s.
 Figure \ref{fig:eulerg_pic} shows a {\pic} consisting of contours $M,N,O,P$ and $Q$.
 
 \begin{figure}[h]