Results 1 to 10 of about 6,809,932 (246)
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +7 more sources
A stronger bound for the strong chromatic index [PDF]
Electronic Notes in Discrete Mathematics, 2015 We prove χ′ s (G) ≤ 1.93 Δ(G)2 for graphs of sufficiently large maximum degree where χ′ s (G) is the strong chromatic index of G. This improves an old bound of Molloy and Reed.
Felix Joos, Henning Brühn
exaly +8 more sources
Upper Bounds for the Strong Chromatic Index of Halin Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2018 The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj +6 more sources
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 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.
Olivier Togni
doaj +8 more sources
The strong chromatic index of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The chromatic index $\chi'(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors.
Yiqiao Wang +3 more
doaj +6 more sources
On the strong chromatic index of cubic Halin graphs [PDF]
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ko-Wei Lih, Daphne Der-Fen Liu
exaly +6 more sources
Strong chromatic index and Hadwiger number [PDF]
Journal of Graph Theory, 2019 We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each k ≥ 4 that any K k ‐minor‐free multigraph of maximum degree Δ has strong chromatic index at most
W. Cames van Batenburg +3 more
semanticscholar +7 more sources
The Strong Chromatic Index of Complete Halin Graphs
MathematicsThe strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G),
Zhiwei Bi, Yunfang Tang
doaj +3 more sources
The strong chromatic index of Halin graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ko-Wei Lih
exaly +5 more sources
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