A new approach to the linearity of testing planarity of graphs
The author presents a new approach to the linearity complexity for testing planarity of a graph G by transforming the problem into that of finding a spanning tree on another graph H, with the order of H being a linear function of G.
scientific article; zbMATH DE number 4091528