Skip to main content
. 2010 Jan 11;11:18. doi: 10.1186/1471-2105-11-18

Figure 2.

Figure 2

Three undirected graphs. Graph (i) is triangulated, that is, contains no chordless cycles of length four or greater. Graph (ii) is not triangulated, since it contains a chordless cycle of length four. Graph (iii) contains both discrete nodes (dots) and continuous nodes (circles). It is triangulated and contains a forbidden path.