Results 201 to 210 of about 4,847 (217)
Some of the next articles are maybe not open access.
Strong chromatic index of subset graphs
Journal of Graph Theory, 1997A coloring of the edges of a graph is called a strong edge coloring if the edges in each color form an induced matching. The strong chromatic index \(sq(G)\) of a graph \(G\) is the smallest number of colors in any strong coloring. A conjecture of Brualdi and Quinn states that if \(G\) is a bipartite graphs, with parts \(X\) and \(Y\), then \(sq(G)\leq\
Quinn, Jennifer J., Benjamin, Arthur T.
openaire +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
The strong chromatic index ofC4-free graphs
Random Structures and Algorithms, 2000The 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
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 Certain Nanosheets
2017Strong edge-coloring of a graph is a proper edge coloring such that every edge of a path of length 3 uses three different colors. The strong chromatic index of a graph is the minimum number k such that there is a strong edge-coloring using k colors and is denoted by c′ s(G).
Ganesan, Vidya, Rajasingh, Indra
openaire +1 more source
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
STRONG CHROMATIC INDEX OF SPARSE GRAPHS WITH MAXIMUM DEGREE 4
Rocky Mountain Journal of MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fu, Jiacong, Lv, Jian-Bo, Li, Xiangwen
openaire +1 more source
Strong chromatic index of K1,t-free graphs
Discrete Applied Mathematics, 2020Michał Debski +2 more
exaly