Results 11 to 20 of about 6,809,932 (246)
Strong chromatic index of subcubic planar multigraphs [PDF]
European Journal of Combinatorics, 2015 The strong chromatic index of a multigraph is the minimum k such that the edge set can be k -colored requiring that each color class induces a matching.
A. Kostochka +5 more
semanticscholar +5 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 +7 more sources
The strong chromatic index of a class of graphs [PDF]
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wensong Lin
exaly +3 more sources
The Strong Chromatic Index of Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2005 The strong chromatic index of a graph $G$, denoted by $\chi_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)$.
Alan Frieze +2 more
exaly +3 more sources
The strong chromatic index of complete cubic Halin graphs [PDF]
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wai Chee Shiu, Wing Ka Tam
exaly +3 more sources
Bounding the strong chromatic index of dense random graphs [PDF]
Discrete Mathematics, 2004 For a finite simple graph \(G\), a strong edge colouring of \(G\) is an edge colouring in which every colour class is an induced matching. (Since each class is a matching, the colouring is proper.) The strong chromatic index of \(G\), \(\chi_{s}(G)\), is the smallest number of colours in a strong edge colouring of \(G\).
Andrzej Czygrinow
exaly +5 more sources
Strong chromatic index of claw-free graphs with edge weight seven [PDF]
Discussiones Mathematicae Graph Theory, 2023 Let $G$ be a graph and $k$ a positive integer. A strong $k$-edge-coloring of $G$ is a mapping $\phi: E(G)\to \{1,2,...,k\}$ such that for any two edges $e$ and $e^'$ that are either adjacent to each other or adjacent to a common edge, $\phi(e)\ne \phi(e^'
Yuquan Lin, Wensong Lin
doaj +3 more sources
Strong Chromatic Index of Graphs With Maximum Degree Four [PDF]
The Electronic Journal of Combinatorics, 2018 A strong edge-coloring of a graph $G$ is a coloring of the edges such that every color class induces a matching in $G$. The strong chromatic index of a graph is the minimum number of colors needed in a strong edge-coloring of the graph.
Mingfang Huang, M. Santana, Gexin Yu
semanticscholar +4 more sources
Strong chromatic index of K1,t-free graphs
Discrete Applied Mathematics, 2020 A strong edge-coloring of a graph G is a coloring of the edges of G such that each color class is an induced matching. The strong chromatic index of G is the minimum number of colors in a strong edge-coloring of G .
Michał Debski +2 more
exaly +2 more sources
Strong chromatic index of k-degenerate graphs [PDF]
Discrete Mathematics, 2013 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
Tao Wang
semanticscholar +3 more sources