An algorithm for planarity testing by adjacency matrix

It is of great use to determine whether a graph is planar in both information technology and engineering areas. Although there are some known algorithms, they are quite difficult to understand and to implement. This paper proposes a new method to determine the planarity of a graph by adjacency matrix, which is very easy to implement. Especially, we give the degree conditions for the planarity of 6-vertex undirected simple graphs.