Results 1 to 10 of about 1,659 (219)
Overview on fuzzy fractional coloring
International Journal of Cognitive Computing in Engineering, 2021 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
Distributed Algorithms for Fractional Coloring [PDF]
Lecture Notes in Computer Science, 2021 16 pages, 2 figures.
Louis Espéret +2 more
exaly +3 more sources
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 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 +3 more sources
On fractional version of oriented coloring
Discrete Applied Mathematics, 2022 15 ...
Sandip Das, Sagnik Sen
exaly +3 more sources
Generalized Fractional Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 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 +3 more sources
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +2 more sources
Generalized Fractional and Circular Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i ∈ ℤr the ...
Kemnitz Arnfried +4 more
doaj +3 more sources
Cubical coloring — fractional covering by cuts and semidefinite programming [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings.
Robert Šámal
doaj +5 more sources
Fractional Coloring of Planar Graphs of Girth Five [PDF]
SIAM Journal on Discrete Mathematics, 2020 19 pages, 3 ...
Xiaolan Hu, Zdenek Dvorak
exaly +4 more sources
Fractional and j-Fold Coloring of the Plane [PDF]
Discrete and Computational Geometry, 2016 We present results referring to the Hadwiger-Nelson problem which asks for the minimum number of colours needed to colour the plane with no two points at distance $1$ having the same colour. Exoo considered a more general problem concerning graphs $G_{[a,b]}$ with $\mathbb{R}^2$ as the vertex set and two vertices adjacent if their distance is in the ...
Jarosław Grytczuk +2 more
exaly +4 more sources