NON-PLANARITY USING CYCLES.

This article proposes a method to examine whether a given undirected simple graph is non-planar using Cycles. The cyclic rotation of the available cycle produces a new cycle. The non-planarity can be fixed depending on whether both cycles are subgraphs of the given graph. Pseudocode for setting up an algorithm for detecting non-planarity for any graph containing at-least one cycle is the highlight of the article. [ABSTRACT FROM AUTHOR]