Results 31 to 40 of about 60,228 (248)
Strong edge-coloring for jellyfish graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gerard J. Chang +4 more
openaire +2 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 +3 more
openaire +2 more sources
Upper Bounds for the Strong Chromatic Index of Halin Graphs
Discussiones Mathematicae Graph Theory, 2018 The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj +1 more source
Strong edge colorings of uniform graphs
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 ...
Czygrinow, Andrzej, Nagle, Brendan
openaire +1 more source
Strong edge-coloring of cubic bipartite graphs: A counterexample
Discrete Applied Mathematics, 2022 A strong edge-coloring $φ$ of a graph $G$ assigns colors to edges of $G$ such that $φ(e_1)\ne φ(e_2)$ whenever $e_1$ and $e_2$ are at distance no more than 1. It is equivalent to a proper vertex coloring of the square of the line graph of $G$. In 1990 Faudree, Schelp, Gyárfás, and Tuza conjectured that if $G$ is a bipartite graph with maximum degree 3 ...
openaire +3 more sources
Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off
, 2016 Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed.
A Telea +14 more
core +1 more source
Coalition Resilient Outcomes in Max k-Cut Games
, 2018 We investigate strong Nash equilibria in the \emph{max $k$-cut game}, where we are given an undirected edge-weighted graph together with a set $\{1,\ldots, k\}$ of $k$ colors. Nodes represent players and edges capture their mutual interests. The strategy
A Bogomolnaia +13 more
core +1 more source
Adjacent strong edge coloring of graphs
Applied Mathematics Letters, 2002 A proper edge coloring of a graph is an adjacent strong edge coloring if, for every adjacent vertices \(u\) and \(v\), the set of colors of all edges at \(u\) is different from the set of all colors of edges at \(v\). The authors determine the minimum number \(k\) such that a tree (a cycle, a complete graph) has an adjacent strong edge coloring with ...
Zhang, Zhongfu +2 more
openaire +2 more sources
Placement Delivery Arrays from Combinations of Strong Edge Colorings [PDF]
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019 It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, and M. Cheng, {\em IEEE Commun. Lett.}, 22(2):236-239 (2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng, X. Tang, and Q.
Jerod Michel, Qi Wang
openaire +2 more sources
Strong chromatic index of sparse graphs [PDF]
, 2013 A 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 $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$.
Dębski, Michał +2 more
core