Results 11 to 20 of about 91,208 (231)
Approximate constrained bipartite edge coloring [PDF]
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caragiannis, Ioannis +5 more
openaire +4 more sources
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring [PDF]
, 2019 A valid edge-coloring of a graph is an assignment of "colors" to its edges such that no two incident edges receive the same color. The goal is to find a proper coloring that uses few colors.
Behnezhad, Soheil +4 more
core +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
Normal edge-colorings of cubic graphs [PDF]
, 2019 A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors having the additional property that when looking at the set of colors assigned to any edge $e$ and the four edges adjacent it, we have either exactly five distinct colors or ...
Jaeger F. +5 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
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
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
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