January 16, 2009
- Snarks! -
A snark is a bridgeless cubic graph (i.e., a biconnected cubic graph) with edge chromatic number of four. (By Vizing’s theorem, the edge chromatic number of every cubic graph is either three or four, so a snark corresponds to the special case of four.) Snarks are therefore class 2 graphs.
These are all Snarks. Thanks to Speedbird for the original 4 color theory connection.
See also: Quintessence/Aether/Void…
And just to test it out: TMBCHR
(batsignals in action here, people)
