problems including the problem of finding a forbidden graph characterization of the graphs with linkless and flat embeddings; Sachs showed that the seven graphs of the Petersen family (including K6) do not have such embeddings. As observed, linklessly embeddable graphs are closed under graph minors, from which it follows by the Robertson–Seymour theorem that a forbidden graph characterization exists. The proof of the existence of a finite set of obstruction graphs does not lead to an explicit description of this set of forbidden minors, but it follows from Sachs' results that the seven graphs of the Petersen family belong to the set. These problems were finally settled by , who showed that the seven graphs of the Petersen family are the only minimal forbidden minors for these graphs. Therefore, linklessly embeddable graphs and flat embeddable graphs are both the same set of graphs, and are both the same as the graphs that have no Petersen family minor. also asked for bounds on the number of edges and the chromatic number of linkless embeddable graphs. The number of edges in an n-vertex linkless graph is at most 4n − 10: maximal apex graphs with n > 4 have exactly this many edges, and proved a matching upper bound on the more general class of K6-minor-free graphs. observed that Sachs' question about the chromatic number would be resolved by a proof of Hadwiger's conjecture that any k-chromatic graph has as a minor a k-vertex complete graph. The proof by of the case k = 6 of Hadwiger's conjecture is sufficient to settle Sachs' question: the linkless graphs can be colored with at most five colors, as any 6-chromatic graph contains a K6 minor and is not linkless, and there exist linkless graphs such as K5 that require five colors. The snark theorem implies that every cubic linklessly embeddable graph is 3-edge-colorable. Linkless embeddings started being studied within the algorithms research community in the late 1980s through the works of and . Algorithmically, the problem of recognizing linkless and flat embeddable graphs was settled once the forbidden minor characterization was proven: an algorithm of can be used to test in polynomial time whether a given graph contains any of the seven forbidden minors. This method does not construct linkless or flat embeddings when they exist, but an algorithm that does construct an embedding was developed by , and a more efficient linear time