Results 11 to 20 of about 12,413 (296)
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
P. Deepa +2 more
doaj +2 more sources
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 +5 more sources
Edge Coloring Of Complement Bipolar Fuzzy Graphs
Ratio Mathematica, 2023 : Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems.
S. Yahya Mohamed, Subashini N
doaj +2 more sources
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Kochol +2 more
openaire +2 more sources
On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
MATEC Web of Conferences, 2016 A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required ...
Liu Jun +4 more
doaj +2 more sources
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +2 more sources
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Axioms, 2023 Neighbor distinguishing colorings of graphs represent powerful tools for solving the channel assignment problem in wireless communication networks. They consist of two forms of coloring: neighbor distinguishing edge coloring, and neighbor distinguishing ...
Jingjing Huo +3 more
doaj +1 more source
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems [PDF]
Journal of Parallel and Distributed Computing, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifa Liang +2 more
openaire +2 more sources
On Colorful Edge Triples in Edge-Colored Complete Graphs [PDF]
Graphs and Combinatorics, 2020 AbstractAn edge-coloring of the complete graph $$K_n$$ K n we call F-caring if it leaves no F-subgraph of $$K_n$$ K n monochromatic and at the same time every subset of |V(F)| vertices contains in it at least one completely multicolored version of F. For the first two meaningful cases, when $$F=K_{1,3}$$ F = K 1 , 3 and $$F=P_4$$ F = P 4
openaire +3 more sources
Restrained star edge coloring of graphs and its application in optimal & safe storage practices
Ratio Mathematica, 2023 In this paper we introduce the concept of restrained star edge coloring of graphs by restraining the conditions of the star coloring of graphs. The restrained star edge coloring of graphs is a path based graph coloring which is said to be proper if all ...
W. Evangeline Lydia +1 more
doaj +1 more source