Results 21 to 30 of about 92,928 (333)
Edge coloring signed graphs [PDF]
Discrete Mathematics, 2020 We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it has a natural definition in terms of vertex coloring of a line graph, and the minimum number of colors required for
openaire +2 more sources
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
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
Color Invariant Edge Detection [PDF]
, 1999 Segmentation based on color, instead of intensity only, pro- vides an easier distinction between materials, on the condition that ro- bustness against irrelevant parameters is achieved, such as illumination source, shadows, geometry and camera sensitivities.
Geusebroek, J.-M. +5 more
openaire +2 more sources
Acyclic edge-coloring using entropy compression [PDF]
, 2013 An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the ...
Aline Parreau +14 more
core +3 more sources
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
Facial graceful coloring of plane graphs [PDF]
Opuscula MathematicaLet \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +1 more source
Nonrepetitive edge-colorings of trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free or nonrepetitive if there is no path with a color pattern that is a repetition.
A. Kündgen, T. Talbot
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