# planar graph

(redirected from Planar graphs)

## planar graph

[′plā·nər ‚graf]
(mathematics)
A graph that can be drawn in a plane without any lines crossing.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
Graphs with a k-regular orientation include planar graphs (k = 3), and planar bipartite graphs (k = 2), though we showed bounds better than Theorem 9 for these classes already.
Akram, Single-valued neutrosophic planar graphs, International Journal of Algebra and Statistics, 5(2)(2016), 157-167.
Let G be a chain of planar graphs defined by G = [C.sub.1] x [C.sub.2] x ...
Among other things, they proved that the vertex-arboricity of planar graphs is at most 3.
Many automatic methods for graph drawing emerged, especially for planar graphs. For nonplanar graphs, efficient or effective drawing methods are needed.
Conjecture 1 has been confirmed for subcubic graphs, [K.sub.4]-minor free graphs, and planar graphs with large maximum degree [2-4].
Pal, "Faces and dual of m-polar fuzzy planar graphs," Journal of Intelligent and Fuzzy Systems, vol.
The MAX CUT problem is solvable in polynomial time for the following special classes of graphs: planar graphs [4-6], line graphs , graphs with bounded treewidth, or cographs .
Saito, A linear 5-coloring algorithm of planar graphs, J.
The planar graphs closed cycles determination method.
We give the general form of the Tutte polynomial of a family of positive-signed connected planar graphs. Then we give general formulas of the Jones polynomial of some very interesting families of alternating knots and links that correspond to these planar graphs.

Site: Follow: Share:
Open / Close