IS THERE ANY SHORT TIME SAVING METHOD TO DETERMINE GRAPH IS PLANNER OR NOT
Yes..
all non planar graph can be obtained from $K_5$ or $K_{3,3}$ using certain permitted operations.
Ref: K.H. Rosen
64.3k questions
77.9k answers
244k comments
80.0k users