Jump to content

Snark

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 213.253.40.116 (talk) at 02:38, 27 May 2002 ('''snark''' is a graph). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

No one has seen a snark and lived to tell the tale.

See: The Hunting of the Snark

In graph theory, a snark is a graph in which each vertex has three edges, but it is impossible to color the edges with only three colors so that edges of the same color don't meet at one vertex. A boojum is a planar snark. See Four-Color Theorem.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Snark&oldid=83603"