Talk:Barnette's conjecture
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
[Untitled][edit]
Barnatte conjecture is a challangin problem in mathematics since 1956 which states that every cubic planar three connected graph is Hamiltonian This challangin problem is finally solved in 2014 by Mushtaq Ahmad shah and published in vol 3 of 2014 (IJMC)also available in USA for references and complete proof visit the following the academy of mathematical combinatorics with applications (AMCA)USA www.mathcombin.com Www.gallup.unm.edu Mushtaq Ahmad shah (talk) 14:23, 19 November 2016 (UTC) Proof of barnette conjecture
- That is not a reliable source, despite calling itself a mathematical journal, and your supposed proof there is nonsense. If you want your work to be discussed here, it needs to be published in a more respectable journal. —David Eppstein (talk) 17:41, 19 November 2016 (UTC)