Results 201 to 210 of about 269,645 (235)

About S-packing coloring of 3-irregular subcubic graphs

Discrete Applied Mathematics
Maidoun Mortada
exaly   +2 more sources

On packing S-colorings of subcubic graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yang, Baoyindureng Wu
openaire   +2 more sources

Oriented paths in digraphs and the S-packing coloring of subcubic graph. (Chemins orientés dans les graphes orientés et coloration S-packing des graphes subcubiques)

, 2023
Cette thèse de doctorat est divisée en deux parties principales: La partie I explore l'existence de chemins orientés dans les digraphes, cherchant à établir un lien entre le nombre chromatique d'un digraphe et l'existence de chemins orientés ...
Batoul Tarhini
semanticscholar   +1 more source

Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems

International Colloquium on Automata, Languages and Programming, 2023
Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from F, covering U with k sets from F, and packing k non-intersecting sets ...
Serge Gaspers, Jerry Li
semanticscholar   +1 more source

Facial packing edge-coloring of plane graphs

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanislav Jendroľ, Julius Czap
exaly   +2 more sources

Selfish colorful bin packing games

Journal of Combinatorial Optimization, 2020
The authors consider selfish colorful bin packing games in which a set of items, each one controlled by a selfish player, are to be packed into a minimum number of unit capacity bins. Each item has one of \(m \geq 2\) colors and no items of the same color may be adjacent in a bin.
Bilo V., Cellinese F., Melideo G., Monaco G.   +3 more
openaire   +5 more sources

Packing random items of three colors

Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wansoo T. Rhee, Michel Talagrand
openaire   +2 more sources

Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn

, 2020
The packing chromatic number χρ of a graph G is the smallest integer k for which there exists a mapping π from V (G) to {1, 2, ..., k} such that any two vertices of color i are at distance at least i + 1.
K. Rajalakshmi, M. Venkatachalam, M. Barani, D. Dafik   +3 more
semanticscholar   +1 more source

On Packing and Coloring Hyperedges in a Cycle

2005
For a hypergraph and k different colors, we study the problem of packing and coloring some hyperedges of the hypergraph as paths in a cycle such that the total profit of the chosen hyperedges are maximized, here each link ej on the cycle is used at most cj times, each hyperedge hi has a profit pi and any two paths, each spanning all vertices of its ...
Jianping Li 0007, Kang Li, Ken C. K. Law, Hao Zhao   +3 more
openaire   +1 more source

A Packing Coloring Based Pilot Allocation Algorithm for the Cell-Free mMIMO System

2024 IEEE Globecom Workshops (GC Wkshps)
Due to the limited pilot resources, the pilot reuse will bring serious pilot contamination to the cell-free (CF) massive multiple input multiple output (mMIMO) system, which makes it difficult to achieve massive ultra-reliable and low-latency ...
Yuting Zhang, Jie Zeng, Biru Zhang, Zhipeng Lin, Xin Su, Tiejun Lv, Xiangyuan Bu   +6 more
semanticscholar   +1 more source