Results 31 to 40 of about 92,019 (279)
Some Equal Degree Graph Edge Chromatic Number
MATEC Web of Conferences, 2016 Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun +4 more
doaj +1 more source
Normal 5-edge-colorings of a family of Loupekhine snarks
AKCE International Journal of Graphs and Combinatorics, 2020 In a proper edge-coloring of a cubic graph an edge uv is called poor or rich, if the set of colors of the edges incident to u and v contains exactly three or five colors, respectively.
Luca Ferrarini +2 more
doaj +1 more source
M_{2}-edge colorings of dense graphs [PDF]
Opuscula Mathematica, 2016 An edge coloring \(\varphi\) of a graph \(G\) is called an \(\mathrm{M}_i\)-edge coloring if \(|\varphi(v)|\leq i\) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\).
Jaroslav Ivančo
doaj +1 more source
The 1-2-3 Conjecture for Hypergraphs [PDF]
, 2016 A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +2 more sources
On facial unique-maximum (edge-)coloring [PDF]
, 2017 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna +4 more
core +3 more sources
Edge Colored hypergraphic Arrangements [PDF]
Pure and Applied Mathematics Quarterly, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Edge-Based Color Constancy [PDF]
IEEE Transactions on Image Processing, 2007 Color constancy is the ability to measure colors of objects independent of the color of the light source. A well-known color constancy method is based on the gray-world assumption which assumes that the average reflectance of surfaces in the world is achromatic.
van de Weijer, J. +2 more
openaire +4 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 +1 more source
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
A note on M_{2}-edge colorings of graphs [PDF]
Opuscula Mathematica, 2015 An edge coloring \(\varphi\) of a graph \(G\) is called an \(M_2\)-edge coloring if \(|\varphi(v)|\le2 \) for every vertex \(v\) of \(G\), where \(\varphi(v)\) is the set of colors of edges incident with \(v\). Let \(K_2(G)\) denote the maximum number of
Július Czap
doaj +1 more source