Results 251 to 260 of about 254,850 (275)
Some of the next articles are maybe not open access.

Algebraic and Combinatorial Algorithms for S-Packing Coloring

ACM Communications in Computer Algebra
S-packing coloring is a generalization of proper coloring of graphs, introduced more than a decade ago. In this paper, we present algebraic and combinatorial algorithms for the problem of S-packing coloring of finite undirected and unweighted graphs.
K. M. Harith   +2 more
semanticscholar   +3 more sources

Partial packing coloring and quasi-packing coloring of the triangular grid

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hubert Grochowski   +1 more
semanticscholar   +3 more sources

About S-packing coloring of subcubic graphs

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maidoun Mortada, Olivier Togni
semanticscholar   +2 more sources

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 Zirui Li
semanticscholar   +1 more source

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.   +3 more
openaire   +5 more sources

Coloring and distortion variants of the bcc packing and for the aristotypes BaAl4 and CeMg2Si2

Zeitschrift für Naturforschung. B, A journal of chemical sciences, 2021
The huge number of intermetallic structure types with many representatives calls for structural systemization. The combination of crystal chemistry with group theory is an efficient tool for such systemization and can be displayed in a concise and ...
S. Seidel, R. Pöttgen
semanticscholar   +1 more source

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   +3 more
semanticscholar   +1 more source

Distance dominator packing coloring of type II

Quaestiones Mathematicae. Journal of the South African Mathematical Society
In 2021, we introduced one type of the generalization of dominator coloring via packing coloring and distance domination. In this paper, we present a second type of such generalization, namely distance dominator packing coloring of type II, defined as ...
Jasmina Ferme, Dasa Stesl
semanticscholar   +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   +6 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy