This is an old revision of this page, as edited by Ruud Koot(talk | contribs) at 22:43, 6 December 2011({{WikiProject Computer science}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 22:43, 6 December 2011 by Ruud Koot(talk | contribs)({{WikiProject Computer science}})
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
I am not sure about application of snarks to four color theorem. Kuszi 00:16, 13 Sep 2004 (UTC)
Today I added two snarky mathematical uses, the four color theorem and the four flow conjecture. See [1] for the diff. I got this info from page 141 of Reinhard Diestel, Graph Theory, Springer, 1997, ISBN 0-387-98211-6. dbenbenn | talk December 25, 2004
