Results 251 to 260 of about 92,019 (279)
Some of the next articles are maybe not open access.
Optical Engineering, 1977
The choice of the color coordinates for extraction of visually significant edges and boundaries in a color image is discussed. The compass gradient edge detection method developed by the author for monochrome images is extended to color edge detection and a quantitative measure is discussed in choosing the color coordinates for edge extraction.
openaire +1 more source
The choice of the color coordinates for extraction of visually significant edges and boundaries in a color image is discussed. The compass gradient edge detection method developed by the author for monochrome images is extended to color edge detection and a quantitative measure is discussed in choosing the color coordinates for edge extraction.
openaire +1 more source
2016
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
Note on injective edge-coloring of graphs
Discrete Applied Mathematics, 2022Song Yimin, Gexin Yu
exaly
2016
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source
Injective edge coloring of graphs with maximum degree 5
Discrete Applied Mathematics, 2023Junlei Zhu
exaly
Injective Edge Coloring for Graphs with Small Edge Weight
Graphs and Combinatorics, 2022Xiaolan Hu
exaly
Acyclic Edge-Coloring of Planar Graphs
SIAM Journal on Discrete Mathematics, 2011Frédéric Havet
exaly