robin/Robin_PHD
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

.

Browse Source
This commit is contained in:
Robin Clark 2010-08-17 15:37:43 +01:00
parent 37678ee9c2
commit 0bedb03c6f
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
eulerg/eulerg.tex
View File

@ -149,10 +149,12 @@ The diagram in figure \ref{fig:eulerg_enc} can now be represented as a graph thu
\pagebreak[0] \pagebreak[0]
\section{The {\pic}} \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 Contours may be connected via `pure intersection' relationships to form
`chains' of contours reachable by pure intersection. `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$. Figure \ref{fig:eulerg_pic} shows a {\pic} consisting of contours $M,N,O,P$ and $Q$.
\begin{figure}[h] \begin{figure}[h]