Results 11 to 20 of about 41,117 (251)
Strong edge-coloring of planar graphs
Discrete Mathematics, 2014 A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We show that 3D + 6 colors suffice if the graph has girth 6, and 3D colors suffice if the girth is at least 7 ...
Riste Škrekovski +2 more
exaly +4 more sources
Strong edge-coloring of 2-degenerate graphs
Discrete Applied Mathematics, 2023 A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $χ_s'(G)$ is the minimum number of colors needed in strong edge-colorings of $G$. A graph is $2$-degenerate if every subgraph has minimum degree at most $2$. Choi, Kim, Kostochka, and Raspaud (2016) showed $χ_s'(G)
Gexin Yu
exaly +3 more sources
Strong Edge Coloring of Cayley Graphs and Some Product Graphs [PDF]
Graphs and Combinatorics, 2022 AbstractA strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper we determine the exact value of the strong chromatic index of all unitary Cayley graphs.
Suresh Dara 0002 +3 more
openaire +4 more sources
Strong edge colorings of graphs [PDF]
Discrete Mathematics, 1996 The strong coloring number of a graph \(G\), \(\chi_s'(G)\), is the minimum number of colors for which there is a proper edge-coloring of \(G\) so that no two vertices are incident to edges having the same set of colors. (It is assumed that \(G\) has no isolated edges and at most one isolated vertex.) {Burris} and Schelp [J.
Odile Favaron +2 more
openaire +3 more sources
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks [PDF]
Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006 We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network.
Barrett, C.L. +5 more
openaire +4 more sources
Strong edge colorings of uniform graphs [PDF]
Discrete Mathematics, 2004 A strong edge coloring of a graph is a (proper) edge coloring in which every color class is an induced matching. The strong chromatic index \(\chi_S(G)\) of a graph \(G\) is the minimum number of colors in a strong edge coloring of \(G\). For a bipartite graph \(G=(U\cup V, E)\), and for two nonempty sets \(U'\subseteq U\) and \(V'\subseteq V\), let ...
Andrzej Czygrinow, Brendan Nagle
openaire +2 more sources
Between proper and strong edge‐colorings of subcubic graphs [PDF]
Journal of Graph Theory, 2020 AbstractIn a proper edge‐coloring the edges of every color form a matching. A matching is induced if the end‐vertices of its edges induce a matching. A strong edge‐coloring is an edge‐coloring in which the edges of every color form an induced matching.
Hervé Hocquard +2 more
core +7 more sources
Strong edge-coloring for jellyfish graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gérard Jennhwa Chang
exaly +3 more sources
Strong edge colorings of graphs and the covers of Kneser graphs [PDF]
Journal of Graph Theory, 2022 AbstractA proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a ‐regular graph at least colors are needed. We show that a ‐regular graph admits a strong edge coloring with colors if and only if it covers the Kneser graph .
Borut Luzar +3 more
openaire +5 more sources
On strong list edge coloring of subcubic graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengke Miao
exaly +3 more sources