Results 31 to 40 of about 408,826 (276)
On coloring of fractional powers of graphs [PDF]
, 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 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 with local demands and applications to degree-sequence bounds on the independence number [PDF]
J. Comb. Theory B, 2018 Tom Kelly, Luke Postle
openalex +2 more sources
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set
Electron. Notes Discret. Math., 2016 Parinya Chalermsook, Daniel Vaz
openalex +3 more sources
Fractional programming formulation for the vertex coloring problem [PDF]
Information Processing Letters, 2014 Tomomi Matsui +2 more
openalex +3 more sources
Fractional Coloring of Bounded Degree Trees
, 2001 We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimizat- ion of the number of wavelengths in wavelength ...
Afonso Ferreira +2 more
openalex +3 more sources
Fractional path coloring on bounded degree trees
, 2001 This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors.
Ioannis Caragiannis +4 more
openalex +3 more sources
Al-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
Science 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
Weighted Graph Coloring for Quantized Computing [PDF]
International Symposium on Information Theory, 2023 We consider the problem of distributed lossless computation of a function of two sources by one common user. To do so, we first build a bipartite graph, where two disjoint parts denote the individual source outcomes.
Derya Malak
semanticscholar +1 more source