Results 261 to 270 of about 254,850 (275)

Colored packing of sets

1987
Abstract Let H be a family of t-sets on {l,2, …, k }. A family of k-sets on v elements is called a (v, k, ϰ)-packing if for all F ∈ there is a copy of ϰ, ϰ F such that the t-sets of F corresponding to H F are covered only by F.
P. Frankl, Z. Füredi
openaire   +1 more source

On packing coloring of helm related graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
The packing chromatic number χ p of a graph G is the smallest integer k for which there exists a mapping π: V(G) → {1, 2 … , k} such that any two vertices of color i are at distance at least i + 1.
K. Rajalakshmi, M. Venkatachalam
semanticscholar   +1 more source

Packing random items of three colors

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

A set packing model for the Partition Coloring Problem

Carpathian Journal of Mathematics
In this paper we propose a set packing model for the Partition Coloring Problem (PCP) a gener alization of the Vertex Coloring Problem (VCP). Given a graph whose vertex set is partitioned in clusters, PCP aims to select one vertex from each cluster such
E. F. Olariu, Cristian Frasinaru
semanticscholar   +1 more source

Packing Densities of Colored and Non-Colored Patterns

GS4 Student Scholars Symposium 2015, 2015
Pattern packing concerns finding an optimal permutation that contains the maximum number of occurrences of a given pattern and computing the corresponding packing density. In many instances such an optimal permutation can be characterized directly and the number of occurrences of the pattern in interest may be enumerated explicitly. In more complicated
openaire   +1 more source

Colored Bin Packing: Online Algorithms and Lower Bounds

Algorithmica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Böhm, Martin, Dósa, György, Epstein, Leah, Sgall, Jiří, Veselý, Pavel   +4 more
openaire   +1 more source

Covering, Coloring, and Packing Hypergraphs

2017
A hypergraph \(\mathcal {H}=(\mathcal V,\mathcal E)\) consists of a (finite) vertex set \(\mathcal V\) and a set of hyper-edges \(\mathcal E\), where each edge \(E\in \mathcal E\) is a subset of \(E\subset \mathcal V\). The vertices will usually be labelled by \(\mathcal V=(v_1,\dots ,v_I)\), the edges by \(\mathcal E=(E_1,\dots ,E_J)\), where \(I,J\in
openaire   +1 more source

On the packing coloring of base-3 Sierpiński graphs and H-graphs

Aequationes Mathematicae, 2020
Fei Deng, Z. Shao, A. Vesel
semanticscholar   +2 more sources

Natural dye from Caesalpinia sappan L. heartwood for eco-friendly coloring of recycled paper based packing material and its in silico toxicity analysis

Environmental science and pollution research international, 2021
V. K. Nathan, M. E. Rani
semanticscholar   +1 more source

Coloring, Packing, and Covering

2020
Fan Chung, Ron Graham
openaire   +1 more source