Results 221 to 230 of about 4,890 (237)

The strong chromatic index of graphs with edge weight eight

Journal of Combinatorial Optimization, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lily Chen   +2 more
exaly   +3 more sources

Strong Chromatic Index of Sparse Graphs

open access: closedJournal of Graph Theory, 2015
AbstractA coloring of the edges of a graph G is strong if each color class is an induced matching of G. The strong chromatic index of G, denoted by , is the least number of colors in a strong edge coloring of G. Chang and Narayanan (J Graph Theory 73(2) (2013), 119–126) proved recently that for a 2‐degenerate graph G.
Daqing Yang, Xuding Zhu
openalex   +3 more sources

Strong Chromatic Index of Certain Nanosheets

2017
Strong 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 SPARSE GRAPHS WITH MAXIMUM DEGREE 4

Rocky Mountain Journal of Mathematics
zbMATH 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, 2020
Michał Debski   +2 more
exaly  

Strong chromatic index of k-degenerate graphs

Discrete Mathematics, 2014
Tao Wang
exaly  

The strong chromatic index of sparse graphs

Information Processing Letters, 2015
Michał Debski   +2 more
exaly  

Home - About - Disclaimer - Privacy