 In addition, Tutte developed an algorithm for determining whether a given binary matroid is a graphic matroid.The algorithm makes use of the fact that a planar graph is simply a graph whose circuit-matroid, the dual of its bond-matroid, is graphic.Tutte wrote a paper entitled "How to Draw a Graph" in which he proved that any face in a 3-connected graph is enclosed by a peripheral cycle.