Harborth's conjecture

Harborth's conjecture is a hypothesis in the field of graph theory, particularly related to the properties of planar graphs. Specifically, it suggests that every planar graph can be colored using at most four colors such that no adjacent vertices share the same color. This assertion is closely related to the well-known Four Color Theorem, which states that four colors are sufficient to color the vertices of any planar graph.