bn:03594714n
Noun Concept
JA
スナーク  スナークグラフ
EN
In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three colors. Wikipedia
English:
graph theory
Relations
Sources