This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
Take a look at the French version. I think it is much better all around. Can we possibly fill this article out? These graphs are very interesting, but I am not expert enough to help.
75.182.110.64 ( talk) 21:35, 8 December 2012 (UTC)
I've rewritten the whole article due to it's pure style. As I am very weak at English, corrections of all kinds are very welcome! I'd also be very glad is someone could draw Q_0,Q_1,Q_2,Q_3 and add the respective picture under the "examples" section. Thanks.
( Stdazi ( talk) 02:19, 8 September 2008 (UTC))
The Picture of constructing Q3 from Q2 is clearly wrong. It has a cycle of length 5, even though hypercube graphs are bipartite and have no odd-length cycles. In order to turn the two copies of Q2 to a copy of Q3 you should either make the top two green edges cross or make the bottom two green edges not cross. If you don't see what I mean, consider the following cycle: the bottom left of the right square, then the bottom left of the left square, then the top left of the left square, then the top right of the left square, then the top left of the right square. this is an odd-length cycle, and it is a mistake. Ekuurh ( talk) 09:34, 9 May 2013 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
Take a look at the French version. I think it is much better all around. Can we possibly fill this article out? These graphs are very interesting, but I am not expert enough to help.
75.182.110.64 ( talk) 21:35, 8 December 2012 (UTC)
I've rewritten the whole article due to it's pure style. As I am very weak at English, corrections of all kinds are very welcome! I'd also be very glad is someone could draw Q_0,Q_1,Q_2,Q_3 and add the respective picture under the "examples" section. Thanks.
( Stdazi ( talk) 02:19, 8 September 2008 (UTC))
The Picture of constructing Q3 from Q2 is clearly wrong. It has a cycle of length 5, even though hypercube graphs are bipartite and have no odd-length cycles. In order to turn the two copies of Q2 to a copy of Q3 you should either make the top two green edges cross or make the bottom two green edges not cross. If you don't see what I mean, consider the following cycle: the bottom left of the right square, then the bottom left of the left square, then the top left of the left square, then the top right of the left square, then the top left of the right square. this is an odd-length cycle, and it is a mistake. Ekuurh ( talk) 09:34, 9 May 2013 (UTC)