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
Graph Coloring Below Guarantees via Co-Triangle Packing
International Symposium on Algorithms and ComputationIn the $\ell$-Coloring Problem, we are given a graph on $n$ nodes, and tasked with determining if its vertices can be properly colored using $\ell$ colors. In this paper we study below-guarantee graph coloring, which tests whether an $n$-vertex graph can
Shyan S. Akmal, T. Koana
semanticscholar +1 more source
On (1,2 14 )-packing coloring of planar graphs with maximum degree at most five
Discrete Mathematics, Algorithms and Applications (DMAA)For a sequence of positive integers [Formula: see text] with [Formula: see text], an [Formula: see text]-packing coloring of a graph [Formula: see text] is a partition of [Formula: see text] into subsets [Formula: see text] such that for every two ...
Xiaonan Ma +3 more
semanticscholar +1 more source
Packing Densities of Colored and Non-Colored Patterns
GS4 Student Scholars Symposium 2015, 2015Pattern 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, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Böhm 0001 +4 more
openaire +1 more source
\((d, n)\)-packing colorings of infinite lattices
Discret. Appl. Math., 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danilo Korze, Aleksander Vesel
openaire +2 more sources
Covering, Coloring, and Packing Hypergraphs
2017A 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
Packing ( 1 , 1 , 2 , 4 ) -coloring of subcubic outerplanar graphs
Discrete Applied Mathematics, 2021Xujun Liu, Alexandr Kostochka
exaly
On $S$-Packing Edge-Coloring of Graphs with Edge Weight at most 6
Social Science Research Network, 2023Jian Lu, Xiang-Feng Pan
semanticscholar +1 more source