BabelNet

bn:03594714n

Noun Concept

Categories: Regular graphs, Graph families, All articles containing potentially dated statements, Graph minor theory, Graph coloring

snark snark theorem

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

Definitions

Relations

Sources

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

A type of graph Wikipedia Disambiguation

IS A

HAS KIND

HAS INSTANCE