Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a new short combinatorial proof of the sufficiency part of the ll-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain -subgraph; (2) G-x-y is homeomorphic to the circle; (3) G is either K5 or Kf3;3g. c 1997 John Wiley & Sons, Inc.
['Yury Makarychev']
I am writing a research paper on a idea A Short Proof of Kuratowski's Graph Planarity Criterion
[{"from": "human", "value": "I am writing a research paper on a idea A Short Proof of Kuratowski's Graph Planarity Criterion"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a new short combinatorial proof of the sufficiency part of the ll-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain -subgraph; (2) G-x-y is homeomorphic to the circle; (3) G is either K5 or Kf3;3g. c 1997 John Wiley & Sons, Inc."}]