On the δ-chromatic numbers of the Cartesian products of graphs
Abstract
In this work, we study the δ-chromatic number of a graph which is the chromatic number of the δ-complement of a graph. We give a structure of the δ-complements and sharp bounds on the δ-chromatic numbers of the Cartesian products of graphs. Furthermore, we compute the δ-chromatic numbers of various classes of Cartesian product graphs, including the Cartesian products between cycles, paths, and stars.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.