@article{oai:yamagata.repo.nii.ac.jp:00000454,
 author = {最首,  和雄 and 小野寺,  力男 and 佐藤,  隆},
 issue = {1},
 journal = {山形大学紀要.工学},
 month = {Feb},
 note = {論文(Article), An efficient algorithm is presented for determing if a given graph is planar. Algorithm 1 is to test whether or not a given three-connected graph can be embedded in a plane and is based on the planar mesh, which is defined in the three-connected planar graph. If |V(G)| is a number of vertices in the graph G, a time required in the computation by using Algorithm 1 is proportional to |V(G)|. To decide the planarity of a given two-connected graph, further, Algorithm 2 is given in the manner of similar techniques in Algorithm 1.},
 pages = {163--171},
 title = {グラフの平面性の判定について},
 volume = {14},
 year = {1976}
}