Results 41 to 50 of about 92,019 (279)
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
Normal 6-edge-colorings of some bridgeless cubic graphs
, 2019 In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct colors, respectively.
Mazzuoccolo, Giuseppe, Mkrtchyan, Vahan
core +1 more source
Deterministic distributed edge-coloring with fewer colors [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1)) $-edge-coloring in polylogarithmic-time, so long as the maximum degree $ =\tilde (\log n)$. For smaller $ $, we give a polylogarithmic-time $3 /2$-edge-coloring.
Mohsen Ghaffari +3 more
openaire +3 more sources
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]
Jisuanji gongcheng, 2017 To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj +1 more source
Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs [PDF]
Journal of Graph Theory, 2019 AbstractIt is conjectured that every edge‐colored complete graph on vertices satisfying contains vertex‐disjoint properly edge‐colored cycles. We confirm this conjecture for , prove several additional weaker results for general , and we establish structural properties of possible minimum counterexamples to the conjecture.
Ruonan Li, Hajo Broersma, Shenggui Zhang
openaire +3 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Edge Cover Through Edge Coloring
The Electronic Journal of CombinatoricsLet $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi(G) \le \delta(G)$, the minimum degree of $G$.
Chen, Guantao, Shan, Songling
openaire +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.
Liang, Weifa, Shen, Xiaojun, Hu, Qing
openaire +2 more sources
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source