Scribd
Upload
13 views3 pages

Presentation

Planarity is a key concept in graph theory that determines if a graph can be drawn on a plane without edge crossings. Important results include Euler’s formula and Kuratowski’s theorem, which help identify planar and non-planar graphs. The study of planar graphs has significant applications in various fields and continues to evolve with advancements in related areas.

Uploaded by

ujjalkakati444
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views3 pages

Presentation

Planarity is a key concept in graph theory that determines if a graph can be drawn on a plane without edge crossings. Important results include Euler’s formula and Kuratowski’s theorem, which help identify planar and non-planar graphs. The study of planar graphs has significant applications in various fields and continues to evolve with advancements in related areas.

Uploaded by

ujjalkakati444
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 3

INTRODUCTIO

N
• Planarity is a fundamental concept in graph theory that examines
whether a given graph can be drawn on a plane without any edges
crossing. A graph is called planar if it can be embedded in the plane in
such a way that no two edges intersect except at their common
endpoints (West, 2001). The study of planar graphs has significant
applications in various fields, including circuit design, geographic
information systems (GIS), and network optimization (Diestel,
2017).The foundation of planar graphs traces back to the work of
Leonhard Euler, who introduced the Euler’s formula for convex
polyhedra, which later extended to planar graphs. Euler’s formula
states that for any connected planar graph with V vertices, E edges,
and F faces, the relation V − E + F = 2 holds true (Bondy & Murty,
2008). This formula provides a crucial criterion for verifying the
planarity of a graph.Another important result in planar graph theory is
Kuratowski’s theorem, which characterizes non-planar graphs by
identifying forbidden substructures. According to this theorem, a
graph is non-planar if and only if it contains a subgraph that is a
subdivision of the complete graph K₅ or the complete bipartite graph
K₃,₃ (Kuratowski, 1930). Additionally, Wagner’s theorem offers an
alternative characterization using graph minors (Wagner, 1937).Planar
graphs also have practical implications in algorithm design, where
many NP-hard problems become efficiently solvable when restricted to
planar graphs (Nishizeki & Rahman, 2004). The study of planarity
continues to evolve with advancements in topological graph theory
and computational geometry, making it a vital area of research in
discrete mathematics.

You might also like