Results 21 to 30 of about 1,659 (219)
Constructive algorithms for the partial directed weighted improper coloring problem
Journal of Graph Algorithms and Applications, 2016 Given a complete directed graph G with weights on the vertices and on the arcs, a θ-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of every vertex v is greater, by a given factor 1/θ, than the
Alain Hertz +2 more
doaj +1 more source
Fractional DP‐colorings of sparse graphs
Journal of Graph Theory, 2019 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
openaire +4 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.
Ken-ichi Kawarabayashi, Bruce A. Reed
openaire +1 more source
IEEE Access, 2018 In this paper, we propose a distributed joint computation offloading and resource allocation optimization (JCORAO) scheme in heterogeneous networks with mobile edge computing.
Jing Zhang +3 more
doaj +1 more source
Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
Entropy, 2019 Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link.
Giuseppe Vettigli +5 more
doaj +1 more source
Fractional colorings of cubic graphs with large girth [PDF]
SIAM Journal on Discrete Mathematics, 2011 We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with ...
Frantisek Kardos +2 more
openaire +3 more sources
On colorings of graph fractional powers
Discrete Mathematics, 2010 \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$.
openaire +3 more sources
On incidence coloring of graph fractional powers
Opuscula Mathematica, 2023 Summary: 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 same vertices of \(G\), where two vertices of \(G^m\) are adjacent if and only if their ...
Mahsa Mozafari-Nia, Moharram N. Iradmusa
openaire +2 more sources
Coloring, list coloring, and fractional coloring in intersections of matroids
CombinatoricaAbstract It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the chromatic number. We investigate the gap within these pairs of parameters for hypergraphs that are the intersection of a given ...
Aharoni, Ron +3 more
openaire +3 more sources
Random independent sets in triangle-free graphs
Forum of Mathematics, SigmaWe establish several new results on the existence of probability distributions on the independent sets in triangle-free graphs where each vertex is present with a given probability.
Anders Martinsson, Raphael Steiner
doaj +1 more source