最終更新日：2024/08/06

(graph theory) A graph which can be embedded in a plane in such a way that its edges only intersect at vertices, i.e., they do not cross each other.

正解を見る

planar graph

問題を編集する

元となった辞書の項目

planar graph

noun

(graph theory) A graph which can be embedded in a plane in such a way that its edges only intersect at vertices, i.e., they do not cross each other.

A planar graph is a graph that can be drawn on a plane without any edges crossing.

意味（1）

(graph theory) A graph which can be embedded in a plane in such a way that its edges only intersect at vertices, i.e., they do not cross each other.