Results 21 to 30 of about 408,826 (276)
Scheduling Wireless Links in the Physical Interference Model by Fractional Edge Coloring [PDF]
IEEE Wireless Communications Letters, 2019 We consider the link scheduling problem in wireless mesh networks for capacity maximization. Unlike all previous approaches, ours views capacity in terms of covering a graph’s edges by matchings that are feasible in the sense of the physical interference
Guilherme I. Ricardo +2 more
openalex +3 more sources
Fractional hypergraph coloring [PDF]
We investigate proper $(a:b)$-fractional colorings of $n$-uniform hypergraphs, which generalize traditional integer colorings of graphs. Each vertex is assigned $b$ distinct colors from a set of $a$ colors, and an edge is properly colored if no single color is shared by all vertices of the edge.
Margarita Akhmejanova, Sean Longbrake
+5 more sources
Fractional and j-Fold Coloring of the Plane [PDF]
Discrete & Computational Geometry, 2016 We present results referring to the Hadwiger–Nelson problem which asks for the minimum number of colors needed to color the plane with no two points at distance 1 having the same color. Exoo considered a more general problem concerning graphs $$G_{[a,b]}$
Jarosław Grytczuk +3 more
semanticscholar +4 more sources
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
Fractional Zero Forcing via Three-color Forcing Games [PDF]
Discrete Applied Mathematics, 2015 An $r$-fold analogue of the positive semidefinite zero forcing process that is carried out on the $r$-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number. Properties of the graph blowup when colored with
Hogben, Leslie +4 more
core +6 more sources
Fractional Path Coloring in Bounded Degree Trees with Applications [PDF]
Algorithmica, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioannis Caragiannis +4 more
openalex +4 more sources
Borel fractional colorings of Schreier graphs [PDF]
Annales Henri Lebesgue, 2022 Let Γ be a countable group and let G be the Schreier graph of the free part of the Bernoulli shift Γ↷2 Γ (with respect to some finite subset F⊆Γ). We show that the Borel fractional chromatic number of G is equal to 1 over the measurable independence number of G.
Anton Bernshteyn
openalex +3 more sources
Fractional coloring and the odd Hadwiger's conjecture
European Journal of Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Kawarabayashi, B. Reed
semanticscholar +2 more sources
Fractional coloring of product signed graphs [PDF]
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
Colorings with Fractional Defect [PDF]
, 2017 Consider a coloring of a graph such that each vertex is assigned a fraction of each color, with the total amount of colors at each vertex summing to $1$. We define the fractional defect of a vertex $v$ to be the sum of the overlaps with each neighbor of $v$, and the fractional defect of the graph to be the maximum of the defects over all vertices. Note
Wayne Goddard, Honghai Xu
openalex +3 more sources