Conference paper
Characterization of a next generation step-and-scan system
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
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
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
Jianke Yang, Robin Walters, et al.
ICML 2023
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications