Results 1 to 10 of about 259,273 (236)
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 +3 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 +4 more sources
Upper Bounds for the Strong Chromatic Index of Halin Graphs
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 +4 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
Strong chromatic index of claw-free graphs with edge weight seven
Discussiones Mathematicae Graph TheorySummary: 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,\dots,k\}\) such that for any two edges \(e\) and \(e^\prime\) that are either adjacent to each other or adjacent to a common edge, \( \phi(e)\neq \phi(e^\prime)\).
Yuquan Lin, Wensong Lin
doaj +3 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 +5 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.
H. Bruhn, Felix Joos
semanticscholar +4 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. C. V. Batenburg +3 more
semanticscholar +6 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 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 +4 more sources