Results 231 to 240 of about 9,499 (262)
Some of the next articles are maybe not open access.
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001 +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001 +4 more
openaire +1 more source
Discrete Mathematics, 2020 Journal of Graph Theory, 1987
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Denis Hanson, Bjarne Toft
openaire +1 more source
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Denis Hanson, Bjarne Toft
openaire +1 more source
A generalization of edge‐coloring in graphs
Journal of Graph Theory, 1986AbstractBounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(ν) times. The known results and proofs generalize in natural ways. Certain new edge‐coloring problems, which have no counterparts when m(ν) = 1 for all ν ϵ V, are studied.
S. Louis Hakimi, Oded Kariv
openaire +2 more sources
Edge Classification for Color Constancy
Conference on Colour in Graphics, Imaging, and Vision, 2008The goal of color constancy is to measure image colors despite differences in the color of the light source. Traditionally, the computational method of obtaining this ability is by using pixel values only. Recently, methods using edges instead of pixel values have been proposed. However, different edge types exist, such as material, shadow and specular
Gijsenij, A. +2 more
openaire +3 more sources
Maximal Edge-Colorings of Graphs
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Meszka, Magdalena Tyniec
openaire +2 more sources
Edge Colorings of Embedded Graphs
Graphs and Combinatorics, 2000The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
Yan, Zhongde, Zhao, Yue
openaire +2 more sources
A bibliographic survey of edge‐colorings
Journal of Graph Theory, 1978AbstractThis paper presents a bibliography on edge‐colorings of graphs which is as complete as possible to date. We introduce the papers by a brief discussion of the ideas involved.
openaire +1 more source
ACM Transactions on Graphics, 2011
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Optimal edge‐coloring with edge rate constraints
Networks, 2013We consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that ...
Dariusz Dereniowski +3 more
openaire +2 more sources