Jump to content

Talk:Snark (graph theory)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RobinK (talk | contribs) at 21:05, 3 January 2010 (Rating article for WikiProject Mathematics. Quality: Start / Priority: Mid / Field: discrete (script assisted). Please report any errors on my talk page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Mid‑priority
WikiProject iconThis 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.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-priority on the project's priority scale.

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