We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...