Research ArticleOpen AccessGoogle Scholar indexed
On a Sufficient and Necessary Condition for Graph Coloring
Department of Mathematics, Zhejiang University, Hangzhou, China
- 1 Department of Mathematics, Zhejiang University, Hangzhou, China
Open Journal of Discrete Mathematics·Volume 04 (2014)·Pages 1–5·Published 23 January 2014·DOI10.4236/ojdm.2014.41001
Copy link · social · email
Abstract
Using the linear space over the binary field that related to a graph G , a sufficient and necessary condition for the chromatic number of G is obtained.
KeywordsVertex ColoringChromatic NumberOuter-Kernel SubspacePlane Graph
- F. Harary, “Graph Theory,” Addison-Wesley, Boston, 1969.
- P. Erdös and A. Hajnal, “Chromatic Number of Finite and Infinite Graphs and Hypergraphs,” Discrete Mathematics, Vol. 53, 1985, pp. 281-285.
- N. Biggs, E. Lloyd and R. Wilson, “Graph Theory 1736-1936,” Oxford University Press, Oxford, 1986.