Edge Coloring and Chromatic Index of Graphs Publication Trend The graph below shows the total number of publications each year in Edge Coloring and Chromatic Index of Graphs.

We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all ...

Abstract The adjacent vertex-distinguishing total chromatic number of a graph 𝐺, denoted by χ𝑎𝑡 (𝐺), is the smallest denoted by 𝑘 for which 𝐺 has a proper total 𝑘-coloring such that any two ...