| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
---- | ---- | ||
| − | I don't necessarily agree with this. That is a Hamilton path described above. A circuit must get back to a causing it to touch c and f twice. It does not pass Dirac's theorem and it does not pass ore's theorem. | + | I don't necessarily agree with this. That is a Hamilton path described above. A circuit must get back to a, causing it to touch c and f twice. It does not pass Dirac's theorem and it does not pass ore's theorem. |
Dirac | Dirac | ||
n=6 | n=6 | ||
| − | degree of every vertex must be at least n/2 | + | degree of every vertex must be at least n/2 which is 3, and a,d,b,e fail this. |
--[[User:Podarcze|Podarcze]] 12:21, 19 November 2008 (UTC) | --[[User:Podarcze|Podarcze]] 12:21, 19 November 2008 (UTC) | ||
Latest revision as of 07:22, 19 November 2008
It does according to Dirac's Theorem. a,b,c,f,d,e
I don't necessarily agree with this. That is a Hamilton path described above. A circuit must get back to a, causing it to touch c and f twice. It does not pass Dirac's theorem and it does not pass ore's theorem.
Dirac n=6 degree of every vertex must be at least n/2 which is 3, and a,d,b,e fail this. --Podarcze 12:21, 19 November 2008 (UTC)
