Results 141 to 150 of about 5,252 (152)
Some of the next articles are maybe not open access.
On (s, t)-relaxed strong edge-coloring of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wensong Lin, Lin Wensong
exaly +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
On strong edge-coloring of graphs with maximum degree 5
Discrete Applied MathematicsA strong edge-coloring of a simple finite graph \(G = (V(G),E(G))\) is a proper edge coloring of \(G\) such that any two edges of distance at most \(2\) receive distinct colors. This is the same as saying that any two vertices in the corresponding line graph \(L(G)\) of \(G\) of distance of at most \(2\) must receive distinct colors.
Jian Lu, Huiqing Liu, Xiaolan Hu
exaly +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
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 +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
Adjacent strong edge colorings and total colorings of regular graphs
Science in China Series A: Mathematics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, ZhongFu +5 more
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
Strong Edge-Coloring of Hamming Graphs
Proceedings of Computer Science and Information Technologies 2023 Conference, 2023Aram Drambyan, Petros Petrosyan
openaire +1 more source