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 130.239.119.229 (talk) at 09:11, 13 May 2022 (Untitled). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Template:Vital article

Untitled

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)[reply]