最終更新日：2025/12/05

(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

(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.

日本語の意味

平面グラフ：各頂点でのみ交差し、辺が互いに交わらずに平面上に描くことができるグラフ。

The professor used a planar graph to demonstrate that the network could be drawn without any crossing edges.

教授は、そのネットワークが辺が交差しないように描けることを示すために、平面上に埋め込めるグラフ（平面グラフ）を用いた。

意味（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.

planar graphs

（ plural ）