Invalid Counterexample in Graph Theory

Yu Qiu

Abstract


By using the color exchange method and convertible property of the topological graph for inside cycle and outside, the colors
of the vertexes on the two cycles in the same position can be corresponded with each other. Thus prove the reducibility
of the 3-cycle and 4-cycle with both vertexes inside and outside. Meanwhile, point out the invalid counterexample of the
“Heawood graph” which was commonly accepted in many textbooks.

Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.