最終更新日：2024/08/03
(graph theory) Of an undirected graph in which no three vertices form a triangle of edges.
正解を見る
triangle-free
編集履歴（0）
(graph theory) Of an undirected graph in which no three vertices form a triangle of edges.
triangle-free
DiQt（ディクト）
無料
★★★★★★★★★★
