6 research outputs found

    Strong chromatic index of k-degenerate graphs

    Full text link
    A {\em strong edge coloring} of a graph GG is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} \chiup_{s}'(G) of a graph GG is the minimum number of colors in a strong edge coloring of GG. In this note, we improve a result by D{\k e}bski \etal [Strong chromatic index of sparse graphs, arXiv:1301.1992v1] and show that the strong chromatic index of a kk-degenerate graph GG is at most (4kβˆ’2)β‹…Ξ”(G)βˆ’2k2+1(4k-2) \cdot \Delta(G) - 2k^{2} + 1. As a direct consequence, the strong chromatic index of a 22-degenerate graph GG is at most 6Ξ”(G)βˆ’76\Delta(G) - 7, which improves the upper bound 10Ξ”(G)βˆ’1010\Delta(G) - 10 by Chang and Narayanan [Strong chromatic index of 2-degenerate graphs, J. Graph Theory 73 (2013) (2) 119--126]. For a special subclass of 22-degenerate graphs, we obtain a better upper bound, namely if GG is a graph such that all of its 3+3^{+}-vertices induce a forest, then \chiup_{s}'(G) \leq 4 \Delta(G) -3; as a corollary, every minimally 22-connected graph GG has strong chromatic index at most 4Ξ”(G)βˆ’34 \Delta(G) - 3. Moreover, all the results in this note are best possible in some sense.Comment: 3 pages in Discrete Mathematics, 201

    The strong chromatic index of 1-planar graphs

    Full text link
    The chromatic index Ο‡β€²(G)\chi'(G) of a graph GG is the smallest kk for which GG admits an edge kk-coloring such that any two adjacent edges have distinct colors. The strong chromatic index Ο‡sβ€²(G)\chi'_s(G) of GG is the smallest kk such that GG has a proper edge kk-coloring with the condition that any two edges at distance at most 2 receive distinct colors. A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, we show that every graph GG with maximum average degree dΛ‰(G)\bar{d}(G) has Ο‡sβ€²(G)≀(2dΛ‰(G)βˆ’1)Ο‡β€²(G)\chi'_{s}(G)\le (2\bar{d}(G)-1)\chi'(G). As a corollary, we prove that every 1-planar graph GG with maximum degree Ξ”\Delta has Ο‡sβ€²(G)≀14Ξ”\chi'_{\rm s}(G)\le 14\Delta, which improves a result, due to Bensmail et al., which says that Ο‡sβ€²(G)≀24Ξ”\chi'_{\rm s}(G)\le 24\Delta if Ξ”β‰₯56\Delta\ge 56
    corecore