• triangle-free

triangle-free (suomeksi)

Määritelmät:

• (lb, en, graph theory) Of an (l, en, undirected graph) in which no three (l, en, vertex, vertices) form a (l, en, triangle) of (l, en, edge, edges).