Results 281 to 290 of about 152,670 (312)
Some of the next articles are maybe not open access.
Edge-colored complete graphs with precisely colored subgraphs
Combinatorica, 1983zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung, F. R. K., Graham, R. L.
openaire +2 more sources
The NP-Completeness of Edge-Coloring
SIAM Journal on Computing, 1981We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.
openaire +2 more sources
Domination in colored complete graphs
Journal of Graph Theory, 1989AbstractWe prove the following conjecture of Erdös and Hajnal: For any fixed positive integer t and for any 2‐coloring of the edges of kn, there exists X ⊂ v(KN) such that |≦| and X monochromatically dominates all but at most n/2t vertices of Kn. In fact, X can be constructed by a fast greedy algorithm.
Erdős, Paul +3 more
openaire +1 more source
Properly colored cycles in edge-colored complete graphs
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dai, Tianjiao +3 more
openaire +2 more sources
Color Visual Cryptography with Completely Randomly Coded Colors
2019The concept of visual cryptography with two completely random shares is applied to color images. In the classic coding the shares are not correlated with the coded image, but are not totally random. We apply a completely random coding, proposed previously for the case of black and white images, to color images. This improves the security of the process.
Arkadiusz Orłowski +1 more
openaire +1 more source
Color image recovery via quaternion matrix completion
2013 6th International Congress on Image and Signal Processing (CISP), 2013In this paper, we present a new method for recovering the color image in a low sample ratio by solving a nuclear norm minimization optimization problem in quaternion number field. This problem is converted to an equivalent semi-definite programming optimization problem, the latter is then solved by solver package based on primal-dual interior point ...
Han, Xu +4 more
openaire +2 more sources
Extending regular edge‐colorings of complete hypergraphs
Journal of Graph Theory, 2019AbstractA coloring (partition) of the collection of all ‐subsets of a set is ‐regular if the number of times each element of appears in each color class (all sets of the same color) is the same number . We are interested in finding the conditions under which a given ‐regular coloring of is extendible to an ‐regular coloring of for and . The case
Amin Bahmanian, Sadegheh Haghshenas
openaire +1 more source
Colorful Isomorphic Spanning Trees in Complete Graphs
Annals of Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source