Skip to main content
. 2012 Jun 6;7(6):e36715. doi: 10.1371/journal.pone.0036715

Figure 4. Example of the two extreme cases of the loop hierarchy.

Figure 4

The network has m faces, where Inline graphic for some integer Inline graphic. Inline graphic of these faces are adjacent squares and the other one is the unbounded face. Vertical edges are removed before horizontal edges as follows: (A) The edges are removed sequentially from left to right. The corresponding co-tree has the shape of a “comb” and the maximal hierarchical level is 2; (B) The edges are removed from left to right skipping every second edge. The process is repeated until all vertical edges except the rightmost one are removed. The corresponding co-tree has the height Inline graphic which is the maximal hierarchical level.