bn:03594714n
Noun Concept
Categories: Graph families, All articles containing potentially dated statements, Regular graphs, Graph minor theory, Graph coloring
EN
snark  snark theorem
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
Definitions
Relations
Sources
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
A type of graph Wikipedia Disambiguation
Wikipedia
Wikidata
EN
Wikipedia Redirections