This study explores the discrete structures of planar graphs, focusing on Fáry’s Theorem and its combinatory consequences. According to Fáry’s Theorem, all planar graphs may be put in the plane using straight edges (e). This explains how planar graphs are formed (d). This study examines how certain combinatorial elements of this result affect graph theory notions like edge crossing, planarity, and vertex connect. Focusing on Fáry’s Theorem’s relevance to computational geometry and optimization, we examine its impact on graph drawing techniques. The study explores the relationship between Fáry’s Theorem and various combinatorial structures, such as Sterling numbers and graph coloring, to gain insight into planar graph behaviour and grouping. The results help us enhance theory and apply it to network design, circuit planning, and spatial data modelling, where planar graph topologies are crucial.