Results 1 to 10 of about 9,430 (262)
On Edge Coloring Bipartite Graphs [PDF]
SIAM Journal on Computing, 1982 The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.
Richard Cole, John Hopcroft
exaly +2 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 +2 more sources
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +2 more sources
Antipodal Edge-Colorings of Hypercubes
Discussiones Mathematicae Graph Theory, 2019 Two vertices of the k-dimensional hypercube Qkare antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y.
West Douglas B., Wise Jennifer I.
doaj +2 more sources
Acyclic and star coloring parameters of fractal cubic networks [PDF]
Scientific ReportsInterconnection networks are more vital in telecommunications because of the significant raise in the demand for high-speed networks as a result of the widespread use of computers and the growth of the internet.
C. Renuga +3 more
doaj +2 more sources
Introduction to dominated edge chromatic number of a graph [PDF]
Opuscula Mathematica, 2021 We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph \(G\), is a proper edge coloring of \(G\) such that each color class is dominated by at least one edge of \(G\).
Mohammad R. Piri, Saeid Alikhani
doaj +1 more source
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
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 +1 more source
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
openaire +3 more sources