Fengchun Lei
Abstract
ly planar graph in S3, and Γ′ a graph obtained by adding a finite number of edges to Γ. The abstract planarity of Γ′ is considered. A necessary and sufficient condition under which Γ′ is abstractly planar is given. Some discussions of planar graph in the viewpoint of flat embedding are done.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
ly planar graph in S3, and Γ′ a graph obtained by adding a finite number of edges to Γ. The abstract planarity of Γ′ is considered. A necessary and sufficient condition under which Γ′ is abstractly planar is given. Some discussions of planar graph in the viewpoint of flat embedding are done.
Key concepts: Planarity testing, Book embedding, Planar graph, Embedding, Planar straight-line graph, Outerplanar graph, Planar, Combinatorics