Results 11 to 20 of about 3,872,853 (232)
From Edge-Coloring to Strong Edge-Coloring [PDF]
The Electronic Journal of Combinatorics, 2015 In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin +6 more
core +6 more sources
Strong edge-coloring of planar graphs [PDF]
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Song Wen-Yao, Miao Lian-Ying
openaire +5 more sources
Strong List Edge Coloring of Subcubic Graphs [PDF]
Mathematical Problems in Engineering, 2013 We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors, respectively.
Hongping Ma +4 more
openaire +2 more sources
Recent progress on strong edge-coloring of graphs
Discrete Mathematics, Algorithms and Applications, 2019 A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
Kecai Deng, Gexin Yu, Xiangqian Zhou
openaire +6 more sources
Strong edge-coloring of $(3, Δ)$-bipartite graphs
Discret. Math., 2014 A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum degree $Δ$. For every such graph, we prove that a strong $4Δ$-edge-coloring can always be obtained.
Bensmail, Julien +2 more
openaire +4 more sources
Parity and strong parity edge-colorings of graphs
Journal of Combinatorial Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsiang-Chun Hsu, Gerard J. Chang
openaire +5 more sources
Extensions of Vizing fans and Vizing's Theorem in graph edge coloring [PDF]
, 2022 Graph edge coloring is a well established subject in the field of graph theory. It is one of the basic combinatorial optimization problem: Color the edges of a graph $G$ with as few colors as possible such that each edge receives a color and adjacent ...
Qi, Xuli
core +1 more source
Strong edge colorings of graphs
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
r-Strong edge colorings of graphs
Discrete Mathematics, 2006 If \(G\) is a graph and \(n\) a natural number, \(\chi(G,n)\) denotes the minimum number of colours required for a proper edge colouring of \(G\) in which no two vertices with distance at most \(n\) are incident to edges coloured with the same set of colours.
Saeed Akbari, Hoda Bidkhori, N. Nosrati
openaire +2 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 +4 more sources