Results 1 to 10 of about 11,868 (264)
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 +3 more sources
Fractional Q-Edge-Coloring of Graphs [PDF]
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 +4 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 +4 more sources
On incidence coloring of graph fractional powers [PDF]
Opuscula Mathematica, 2022 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 +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
Generalized Fractional Total Colorings of Complete Graph [PDF]
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 +3 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 +4 more sources
Fractional (P,Q)-Total List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2013 Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r − 1, the ...
Kemnitz Arnfried +2 more
doaj +4 more sources
Fractional coloring with local demands [PDF]
, 2018 We investigate fractional colorings of graphs in which the amount of color given to a vertex depends on local parameters, such as its degree or the clique number of its neighborhood; in a \textit{fractional $f$-coloring}, vertices are given color from ...
Kelly, Tom, Postle, Luke
core +1 more source
Fractional coloring of triangle-free planar graphs [PDF]
, 2014 We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\frac{1}{n+1/3}$
Dvořák, Zdeněk +2 more
core +5 more sources