 Since the product of two odd cycle graphs contains an odd cycle, the product "G" × "H" is not 2-colorable either.In other words, if "G" × "H" is 2-colorable, then at least one of "G" and "H" must be 2-colorable as well.The next case has been proved long after the conjecture's statement, by