%0 Journal Article
%T Some Ramsey theorems for finite n-colorable and n-chromatic graphs
%A Lionel Nguyen Van Th¨¦
%J Contributions to Discrete Mathematics
%D 2010
%I University of Calgary
%X Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
%U http://cdm.math.ucalgary.ca/cdm/index.php/cdm/article/view/214