Results 11 to 20 of about 1,659 (219)
Fractional (P,Q)-Total List Colorings of Graphs
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 +2 more sources
Fractional programming formulation for the vertex coloring problem [PDF]
6 pages, 5 ...
Noriyoshi Sukegawa, Tomomi Matsui
exaly +4 more sources
Fractional Path Coloring in Bounded Degree Trees with Applications [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioannis Caragiannis
exaly +3 more sources
A note on fractional DP-coloring of graphs
13 pages.
Jeffrey Mudrock, Hemanshu Kaul
exaly +3 more sources
Circular coloring and fractional coloring in planar graphs [PDF]
AbstractWe study the following Steinberg‐type problem on circular coloring: for an odd integer , what is the smallest number such that every planar graph of girth without cycles of length from to admits a homomorphism to the odd cycle (or equivalently, is circular ‐colorable).
Xiaolan Hu, Jiaao Li
openaire +3 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 +1 more source
Background:Understanding fractions in mathematics often poses greater complexity compared to integral numbers. The primary difficulty lies in students' inadequate grasp of fractional basics, notably in comparing and sequencing fractions.
Ria Febriani +2 more
doaj +1 more source
Precise quantification of forest fire impacts is critical for management strategies in support of post-fire mitigation. In this regard, optical remote sensing imagery in combination with spectral unmixing has been widely used to measure fire severity by ...
Kira Anjana Pfoch +3 more
doaj +1 more source
Improved Distributed Fractional Coloring Algorithms
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 at least $q$ colors from $\{1,\dots,p\}$ such that adjacent nodes are assigned disjoint sets of ...
Alkida Balliu +2 more
openaire +4 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)$.
Zdenek Dvorák 0001 +2 more
openaire +4 more sources

