Talk:Snark (graph theory)
Appearance
![]() | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||
Template:Vital article Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
|
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
Tutte conjecture
One of two cases from proof of theorem that every snark has Petersen graph as a minor was published here: https://arxiv.org/pdf/1411.4352.pdf. Proof of second case was still "in preparation" at November 2015. --Miteusz (talk) 20:28, 18 January 2017 (UTC)