Results 11 to 20 of about 259,273 (236)
On the Strong Chromatic Index of Sparse Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 The strong chromatic index of a graph $G$, denoted $\chi'_s(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors.
Philip DeOrsey +9 more
semanticscholar +5 more sources
The strong chromatic index of sparse graphs [PDF]
Information Processing Letters, 2013 A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$.
Michał Deͅbski +2 more
semanticscholar +5 more sources
Fractional strong chromatic index of bipartite graphs
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Micha Dbski
semanticscholar +4 more sources
ON STRONG CHROMATIC INDEX OF SOME OPERATIONS ON GRAPHS
Proceedings of the YSU A: Physical and Mathematical SciencesA strong edge-coloring of a graph $G$ is a mapping $\phi : E(G) \rightarrow \mathbb{N}$ such that the edges at distance $0$ or $1$ receive distinct colors. The minimum number of colors required for such a coloring is called the strong chromatic index of $
A. Drambyan
semanticscholar +3 more sources
The strong chromatic index of Halin graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsin-Hao Lai, Ko-Wei Lih, Ping-Ying Tsai
semanticscholar +3 more sources
A Bound on the Strong Chromatic Index of a Graph,
Journal of Combinatorial Theory, Series B, 1997 The strong chromatic index \(s\chi'(G)\) of a graph \(G\) is the minimum number of colors in a proper edge coloring of a graph in which no edge is adjacent to an edge of the same color. It is proved that \(s\chi'(G)\leq 1.998\Delta^2\), where \(\Delta\) is the maximum degree of a vertex of \(G\). This answers a question of Erdös and Nešetřil, which was
Michael Molloy, B. Reed
semanticscholar +3 more sources
The strong chromatic index of graphs and subdivisions
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Nakprasit, Kittikorn Nakprasit
semanticscholar +2 more sources
The strong chromatic index of (3, Δ)-bipartite graphs
Discrete Mathematics, 2017 A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $\Delta$. We show that every such graph has a strong edge-coloring using at most $3 \Delta$ colors.
Mingfang Huang, Gexin Yu, Xiangqian Zhou
semanticscholar +3 more sources
On the strong chromatic index of cubic Halin graphs
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ko-Wei Lih, Daphne Der-Fen Liu
semanticscholar +3 more sources
The strong chromatic index of a class of graphs
Discrete Mathematics, 2008 The strong chromatic index of a graph G is the minimum integer k such that the edge set of G can be partitioned into k induced matchings. Faudree et al. [R.J. Faudree, R.H. Schelp, A. Gyarfas, Zs.
Jianzhuan Wu, Wensong Lin
semanticscholar +2 more sources