Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
It is shown that there is an absolute constant c with the following property: For any two graphs G1 = (V, E1) and G2 = (V, E2) on the same set of vertices, where G1 has maximum degree at most d and G2 is a vertex disjoint union of cliques of size cd each, the chromatic number of the graph G = (V, E1 U E2) is precisely cd. The proof is based on probabilistic arguments. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Chai Wah Wu
Linear Algebra and Its Applications