Strong chromatic index of k-degenerate graphs
نویسندگان
چکیده
منابع مشابه
Strong chromatic index of k-degenerate graphs
A strong edge coloring of a graph G is a proper edge coloring in which every color class is an induced matching. The strong chromatic index χs(G) of a graph G is the minimum number of colors in a strong edge coloring of G. In this note, we improve a result by Dębski et al. [Strong chromatic index of sparse graphs, arXiv:1301.1992v1] and show that the strong chromatic index of a k-degenerate gra...
متن کاملGame chromatic index of k-degenerate graphs
We consider the following edge coloring game on a graph G. Given t distinct colors, two players Alice and Bob, with Alice moving ®rst, alternately select an uncolored edge e of G and assign it a color different from the colors of edges adjacent to e. Bob wins if, at any stage of the game, there is an uncolored edge adjacent to colored edges in all t colors; otherwise Alice wins. Note that when ...
متن کاملThe relaxed game chromatic index of k-degenerate graphs
The (r, d)-relaxed coloring game is a two-player game played on the vertex set of a graph G. We consider a natural analogue to this game on the edge set of G called the (r, d)-relaxed edge-coloring game. We consider this game on trees and more generally, on k-degenerate graphs. We show that if G is k-degenerate with (G) = , then the first player, Alice, has a winning strategy for this game with...
متن کاملStrong Chromatic Index of Products of Graphs
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for the strong chromatic index of three different products of graphs in terms of the strong chromatic index of each factor. For the Cartesian product of paths, cycles or complete graphs, we derive sharper ...
متن کاملThe Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.04.016