Topology coloring
Authors
Abstract:
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in different conditions of space such as compression or overlap, normality or metric, and continuity, etc. Get the desired result. Then, by proving the theorems and the multiple ones, the color number assigned to each mapping with its specific conditions is obtained. It is proved that, except for one exception mentioned in the text, this number increases to at most n + 3, depending on the particular conditions of each space. Where n can also be subject to finite conditions.
similar resources
Coloring graphs using topology
Higher dimensional graphs can be used to color 2dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More effic...
full textThe Topology of the Coloring Complex
In a recent paper, E. Steingŕımsson associated to each simple graph G a simplicial complex ∆G denoted as the coloring complex of G. Certain nonfaces of ∆G correspond in a natural manner to proper colorings of G. Indeed, the h-vector is an affine transformation of the chromatic polynomial χG of G, and the reduced Euler characteristic is, up to sign, equal to |χG(−1)| − 1. We show that ∆G is cons...
full textBetween coloring and list-coloring: μ-coloring
A new variation of the coloring problem, μ-coloring, is defined in this paper. Given a graph G and a function μ, a μ-coloring is a coloring where each vertex v of G must receive a color at most μ(v). It is proved that μ-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. The notion of perfection is extended for μ-coloring, l...
full textSub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...
full text$LG$-topology
In this paper, we introduce a new model of point free topology for point-set topology. We study the basic concepts in this structure and will find that it is naturally close to point-set topology.
full textFrom Edge-Coloring to Strong Edge-Coloring
In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: k-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian [18]. In this coloring, the set S(v) of colors used by edges incident to a vertex v does not intersect S(u) on more than k colors when u and v are adjacent. We provide some sharp upper and lower bounds for χk-int for several ...
full textMy Resources
Journal title
volume 8 issue 2
pages 0- 0
publication date 2022-05
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023