If a picture is worth a thousand words, then surely clutters are among the least intuitively compelling objects studied in combinatorics. What picture is conveyed by a family of subsets of a finite set, none of which contains any other? A large Venn diagram perhaps, in which certain unions of regions cannot be empty? In this expository note we discuss a simple technique for visualizing arbitrary clutters using graphs.