Results 241 to 250 of about 3,872,892 (256)
Some of the next articles are maybe not open access.
Strong edge-colorings of planar graphs with small girth
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yirong Guo +2 more
openaire +3 more sources
Strong edge-coloring of subcubic planar graphs
Discrete Mathematics, Algorithms and Applications, 2017A 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
A Note on Strong Edge Coloring of Sparse Graphs
Acta Mathematica Sinica, English Series, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong, Wei, Li, Rui, Xu, Bao Gang
openaire +2 more sources
Strong Edge-Coloring of Pseudo-Halin Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li, Jian-Bo Lv
openaire +1 more source
On (s, t)-relaxed strong edge-coloring of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan He, Wensong Lin
openaire +3 more sources
On strong edge-coloring of graphs with maximum degree 4
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Xiangwen Li, Gexin Yu
openaire +2 more sources
Strong Edge Colorings of Graphs
2015In 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
Strong Edge Coloring of Outerplane Graphs with Independent Crossings
Acta Mathematicae Applicatae Sinica, English SerieszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ke-Jie, Zhang, Xin
openaire +2 more sources
The strong edge colorings of a sparse random graph
Australas. J Comb., 1998The 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 +2 more sources