Interval edge-colorings of graph products
Abstract
An interval t-coloring of a graph G is a proper edge-coloring of G with colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t, and the edges incident to each vertex v∈ V(G) are colored by dG(v) consecutive colors, where dG(v) is the degree of the vertex v in G. In this paper interval edge-colorings of various graph products are investigated.
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.