P. Erdös and A. Hajnal, “Chromatic Number of Finite and Infinite Graphs and Hypergraphs,” Discrete Mathematics, Vol. 53, 1985, pp. 281-285.
has been cited by the following article:
TITLE: On a Sufficient and Necessary Condition for Graph Coloring
AUTHORS: Maodong Ye
KEYWORDS: Vertex Coloring; Chromatic Number; Outer-Kernel Subspace; Plane Graph
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.4 No.1, January 23, 2014
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.