Results 1 to 10 of about 408,826 (276)
Overview on fuzzy fractional coloring
In data science, there are still a variety of uncertainty attributes of objects which can’t be accurately represented numerically, under which case, fuzzy mathematics provides technologies and theoretical guarantee for the representations of their ...
Wei Gao, Weifan Wang
doaj +4 more sources
On incidence coloring of graph fractional powers [PDF]
For any \(n\in \mathbb{N}\), the \(n\)-subdivision of a graph \(G\) is a simple graph \(G^\frac{1}{n}\) which is constructed by replacing each edge of \(G\) with a path of length \(n\). The \(m\)-th power of \(G\) is a graph, denoted by \(G^m\), with the
Mahsa Mozafari-Nia, Moharram N. Iradmusa
doaj +4 more sources
Fractional Q-Edge-Coloring of Graphs [PDF]
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +5 more sources
Distributed Algorithms for Fractional Coloring [PDF]
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It is known that for every real $
Nicolás Bousquet +2 more
semanticscholar +6 more sources
On fractional version of oriented coloring [PDF]
15 ...
Sandip Das +3 more
semanticscholar +5 more sources
Coloring, list coloring, and fractional coloring in intersections of matroids [PDF]
It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the chromatic number.
Ron Aharoni +3 more
semanticscholar +7 more sources
Improved Distributed Fractional Coloring Algorithms [PDF]
We prove new bounds on the distributed fractional coloring problem in the LOCAL model. Fractional $c$-colorings can be understood as multicolorings as follows. For some natural numbers $p$ and $q$ such that $p/q\leq c$, each node $v$ is assigned a set of
Alkida Balliu +2 more
semanticscholar +6 more sources
Generalized Fractional Total Colorings of Graphs
Let P and Q be additive and hereditary graph properties and let r, s be integers such that r ≥ s. Then an r/s -fractional (P,Q)-total coloring of a finite graph G = (V,E) is a mapping f, which assigns an s-element subset of the set {1, 2, . . .
Karafová Gabriela, Soták Roman
doaj +4 more sources
Circular coloring and fractional coloring in planar graphs [PDF]
We study the following Steinberg‐type problem on circular coloring: for an odd integer k≥3 , what is the smallest number f(k) such that every planar graph of girth k without cycles of length from k+1 to f(k) admits a homomorphism to the odd cycle Ck (or ...
Xiaolan Hu, Jiaao Li
semanticscholar +6 more sources
Fractional Coloring of Triangle-Free Planar Graphs [PDF]
We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.
Zdenĕk Dvořák +2 more
semanticscholar +7 more sources

