N. Biggs, E. Lloyd and R. Wilson, “Graph Theory 1736-1936,” Oxford University Press, Oxford, 1986.
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.