The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...