Results 241 to 250 of about 41,117 (251)

A Note on Strong Edge Coloring of Sparse Graphs

Acta Mathematica Sinica, English Series, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong, Wei, Li, Rui, Xu, Bao Gang
openaire   +2 more sources

Strong edge-coloring of subcubic planar graphs

Discrete Mathematics, Algorithms and Applications, 2017
A strong[Formula: see text]-edge-coloring of a graph [Formula: see text] is a mapping [Formula: see text]: [Formula: see text], such that [Formula: see text] for every pair of distinct edges at distance at most two. The strong chromatical index of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a ...
Yuehua Bu, Hongguo Zhu
openaire   +2 more sources

Strong Edge Colorings of Graphs

2015
In the preceding chapters we have discussed unrestricted edge colorings that, in a variety of ways, induce vertex colorings that are either vertex-distinguishing or neighbor-distinguishing. In this chapter, we turn our attention from unrestricted edge colorings to proper edge colorings that induce set-defined vertex colorings which are either vertex ...
openaire   +1 more source

On strong edge-coloring of graphs with maximum degree 4

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Xiangwen Li, Gexin Yu
openaire   +1 more source

The strong edge colorings of a sparse random graph [PDF]

Australas. J Comb., 1998
The strong chromatic index of a graph is the smallest integer \(k\) such that the edge set can be partitioned into \(k\) induced subgraphs which are matchings. In this paper the behavior of the strong chromatic index of a sparse, binomial random graph is studied.
openaire   +1 more source

Strong Edge Coloring of Subquartic Graphs

2023
Junlei Zhu, Hongguo Zhu
openaire   +1 more source

Strong Edge Coloring of Outerplane Graphs with Independent Crossings

Acta Mathematicae Applicatae Sinica, English Series
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ke-Jie, Zhang, Xin
openaire   +2 more sources

Strong Edge-Coloring of Hamming Graphs

Proceedings of Computer Science and Information Technologies 2023 Conference, 2023
Aram Drambyan, Petros Petrosyan
openaire   +1 more source

List strong edge-coloring of graphs with maximum degree 4

Discrete Mathematics, 2020
Donglei Yang, Meijie Ma
exaly  

STRONG EDGE COLORING OF FIBONACCI AND LUCAS CUBES

Herald of Russian-Armenian (Slavonic) University humanities and social sciences, 2022
A. Drambyan, T. Petrosyan
openaire   +1 more source