Results 11 to 20 of about 408,826 (276)
Fractional coloring of planar graphs of girth five [PDF]
SIAM Journal on Discrete Mathematics, 2018 A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint.
Zdenĕk Dvořák, Xiaolan Hu
semanticscholar +7 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
A Note on Fractional DP-Coloring of Graphs [PDF]
Discrete Mathematics, 2019 13 pages.
Hemanshu Kaul +2 more
semanticscholar +5 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
On Coloring of graph fractional powers [PDF]
Discrete Mathematics, 2008 \noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$.
Moharram N. Iradmusa
openalex +4 more sources
Fractional DP-Colorings of Sparse Graphs [PDF]
Journal of Graph Theory, 2018 AbstractDP‐coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle [J. Combin. Theory Ser. B 129 (2018), pp. 38–54]. In this paper we introduce and study the fractional DP‐chromatic number .
Anton Bernshteyn +2 more
openalex +5 more sources
Fractional Graph Coloring for Functional Compression with Side Information [PDF]
Information Theory Workshop, 2022 We describe a rational approach to reduce the computational and communication complexities of lossless point-to-point compression for computation with side information.
Derya Malak
openalex +3 more sources
Remarks on Fractional Locally Harmonious Coloring
Open Journal of Mathematical Sciences, 2018 Wei Gao
semanticscholar +3 more sources