Figures & data
Figure 1. Examples of graphs which do not possess any totally disconnecting graphoidal cover.
Figure 2. Examples of Necklace Blocks for (i) k > 2, and (ii)
Figure 3. Example of an infinite graph having free paths of only infinite length yet not graphoidally independent.
Figure 4. Example of an infinite graph not having any pendant vertex yet not graphoidally independent.
Figure 5. Example of an infinite graph not having any pendant vertex or free path but still not graphoidally independent.
Figure 6. Example of a graphoidally independent infinite tree.
Figure 7. Example of a 2-edge Connected Graphoidally Independent Graph.
Figure 8. Example of an infinite cactus which is not graphoidally independent.
