Results 21 to 30 of about 6,809,932 (246)
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 +6 more sources
On the strong chromatic index of cyclic multigraphs [PDF]
Discrete Applied Mathematics, 2000 The strong chromatic index \(\text{sq}(G)\) of a multigraph \(G\) is the smallest number of colours needed to colour the edges of \(G\) so that each colour class is an induced matching. The largest size of a submultigraph of \(G\) without any induced matching of size two is denoted by \(\eta(G)\).
Pavol Gvozdjak +3 more
openaire +3 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
Strong list-chromatic index of subcubic graphs [PDF]
Discrete Mathematics, 2018 A strong $k$-edge-coloring of a graph G is an edge-coloring with $k$ colors in which every color class is an induced matching. The strong chromatic index of $G$, denoted by $χ'_{s}(G)$, is the minimum $k$ for which $G$ has a strong $k$-edge-coloring.
Gexin Yu, Donglei Yang
exaly +5 more sources
Strong Chromatic Index Of Planar Graphs With Large Girth
Discussiones Mathematicae Graph Theory, 2014 Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of ...
Jennhwa Chang Gerard +3 more
doaj +5 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
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
The strong chromatic index of (3, Δ)-bipartite graphs
Discret. Math., 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 $Δ$. We show that every such graph has a strong edge-coloring using at most $3 Δ$ colors.
Mingfang Huang +2 more
semanticscholar +7 more sources
The strong chromatic index of Kt,t-free graphs
CoRRA strong edge coloring of a graph $G$ is an edge coloring $ϕ\,:\,E(G) \rightarrow \mathbb N$ such that each color class forms an induced matching in $G$. The strong chromatic index of $G$, written $χ'_s(G)$, is the minimum number of colors needed for a strong edge coloring of $G$. Erdős and Nešetřil conjectured in 1985 that if $G$ has maximum degree $d$
Richard Bi +3 more
semanticscholar +3 more sources
A note on the strong chromatic index of bipartite graphs [PDF]
Discrete Mathematics, 2008 A strong edge-coloring of a graph \(G\) is an edge-coloring in which every color class is an induced matching; that is, if edges \(uv\) and \(wz\) have the same color, then the pair \(uw, uz, vw\) and \(vz\) are all non-edges of \(G\). The strong chromatic index \(s'(G)\) is the minimum number of colors in a strong edge-coloring of \(G\).
Nakprasit, K.
openaire +2 more sources