Results 21 to 30 of about 11,868 (264)

On fractional version of oriented coloring [PDF]

open access: greenDiscrete Applied Mathematics, 2021
15 ...
Sandip Das   +3 more
openalex   +3 more sources

Fractional Coloring of Triangle-Free Planar Graphs [PDF]

open access: diamondThe Electronic Journal of Combinatorics, 2015
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
openalex   +5 more sources

A Note on Fractional DP-Coloring of Graphs [PDF]

open access: greenDiscrete Mathematics, 2019
13 pages.
Hemanshu Kaul   +2 more
openalex   +3 more sources

Learning trajectory in the material of comparing and ordering fractions using paper folding for elementary school students

open access: yesAl-Jabar, 2023
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

Mapping forest fire severity using bi-temporal unmixing of Sentinel-2 data - Towards a quantitative understanding of fire impacts

open access: yesScience of Remote Sensing, 2023
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

Remarks on Fractional Locally Harmonious Coloring

open access: diamondOpen Journal of Mathematical Sciences, 2018
Wei Gao
openalex   +2 more sources

On coloring of fractional powers of graphs [PDF]

open access: green, 2012
For $m, n\in \N$, the fractional power $\Gmn$ of a graph $G$ is the $m$th power of the $n$-subdivision of $G$, where the $n$-subdivision is obtained by replacing each edge in $G$ with a path of length $n$. It was conjectured by Iradmusa that if $G$ is a connected graph with $ (G)\ge 3$ and $1 (H^{3/5})$.
Stephen G. Hartke   +2 more
openalex   +3 more sources

Fractional coloring of product signed graphs [PDF]

open access: green
This study examines the fractional chromatic number associated with the direct product of signed graphs. It shows that if $(H,τ)$ is a signed circulant graph $G(n,S,T)$, then for any signed graph $(G,σ)$, the fractional chromatic number of their direct product is the lower number between the fractional chromatic number of $(G,σ)$ and $(H,τ)$.
Pie Desire Ebode Atangana
openalex   +3 more sources

Fractional coloring of planar graphs of girth five [PDF]

open access: greenSIAM Journal on Discrete Mathematics, 2018
19 pages, 3 ...
Zdenĕk Dvořák, Xiaolan Hu
openalex   +5 more sources

Extensions of Fractional Precolorings show Discontinuous Behavior [PDF]

open access: yes, 2012
We study the following problem: given a real number k and integer d, what is the smallest epsilon such that any fractional (k+epsilon)-precoloring of vertices at pairwise distances at least d of a fractionally k-colorable graph can be extended to a ...
Albertson   +18 more
core   +6 more sources

Home - About - Disclaimer - Privacy