Title :
The Conditions for Isomorphism of Two Graphs and Some Results on Four-Colorable Conjecture
Author :
Liu, Fugui ; Lu, Kaisheng
Author_Institution :
Wuhan Univ. of Technol., Wuhan
Abstract :
This paper gives a necessary condition for isomorphism of two graphs, and puts forward a new method about judging non-isomorphism of them. Besides, it presents a necessary and sufficient condition for isomorphism of two graphs by using a conclusion known in the reconstruction graph, and a new method for judging isomorphism of two graphs. It also proves the theorem; Let G be the planar graph of order p, then G is at most four colorable when 2 les p <11.
Keywords :
graph colouring; four-colorable conjecture; graph isomorphism; necessary condition; planar graph; reconstruction graph; sufficient condition; Educational institutions; Graph theory; Power engineering and energy; Sufficient conditions; four-colorable conjecture; isomorphism; main; reconstruction; sub-graph;
Conference_Titel :
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location :
Haikou
Print_ISBN :
978-0-7695-2875-5
DOI :
10.1109/ICNC.2007.713
