Results 1 to 10 of about 4,890 (237)
Some of the next articles are maybe not open access.
Strong edge chromatic index of the generalized Petersen graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baoyindureng Wu
exaly +2 more sources
The strong chromatic index ofC4-free graphs
Random Structures and Algorithms, 2000 The strong chromatic index of a graph \(G\) is the minimum number of induced matchings which partition \(E(G)\). In 1985, Erdős and Nešetřil conjectured that the strong chromatic index of every graph of maximum degree \(\Delta\) is at most \((5/4)\Delta^2\). Using a probabilistic method the author proves an asymptotically better result for graphs which
Mohammad Mahdian
openalex +3 more sources
Strong Chromatic Index of 2-Degenerate Graphs
J. Graph Theory, 2012 Summary: We prove that the strong chromatic index of a 2-degenerate graph is linear in the maximum degree \(\Delta \). This includes the class of all chordless graphs (graphs in which every cycle is induced) which in turn includes graphs where the cycle lengths are multiples of four, and settles a problem by \textit{R. J. Faudree} et al. [Ars Comb. 29B,
Gerard J. Chang, N. Narayanan
+4 more sources
Strong chromatic index of K4-minor free graphs
Information Processing Letters, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yiqiao Wang, Ping Wang, Weifan Wang
openalex +2 more sources
Proof of a conjecture on the strong chromatic index of Halin graphs
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yang, Baoyindureng Wu
openaire +1 more source
Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs
Discrete Mathematics, Algorithms and Applications, 2021The strong edge coloring of a graph G is a proper edge coloring that assigns a different color to any two edges which are at most two edges apart. The minimum number of color classes that contribute to such a proper coloring is said to be the strong chromatic index of G. This paper defines the strong chromatic index for the generalized Jahangir graphs
Vikram Srinivasan Thiru, S. Balaji 0001
openaire +2 more sources
Strong chromatic index in subset graphs
Ars Comb., 1998The strong chromatic index \(\text{sq}(G)\) of a graph \(G\) is the minimum number of colors to color the edges of \(G\) such that each color class forms an induced matching in \(G\). For positive integers \(k\leq m\), the subset graph \(B_m(k)\) is the bipartite graph \((X,Y)\), where \(X\) is an \(m\)-element set and \(Y\) is the set of all \(k ...
Jennifer J. Quinn, Eric Lars Sundberg
openaire +1 more source
Strong chromatic index of unit distance graphs
Journal of Graph Theory, 2018Abstract The strong chromatic index of a graph , denoted by , is defined as the least number of colors in a coloring of edges of , such that each color ...
openaire +2 more sources
Strong Chromatic Index of Graphs with Small Girth
Yuehua Bu, Hongrui Zheng, Hongguo Zhu
openalex +2 more sources
Strong chromatic index of \(K_{1, t}\)-free graphs
Discret. Appl. Math., 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Debski +2 more
openaire +2 more sources