Results 11 to 20 of about 179,193 (249)
Packing coloring of hypercubes with extended Hamming codes [PDF]
Discrete Applied Mathematics, 2023 A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at least $k+1$.
Kranjc, Jaka +3 more
core +5 more sources
On packing and coloring hyperedges in a cycle [PDF]
Discrete Applied Mathematics, 2007 Given a hypergraph and k different colors, we study the problem of packing and coloring a subset of the hyperedges of the hypergraph as paths in a cycle such that the total profit of the hyperedges selected is maximized, where each physical link ej on ...
Li, Jianping, Zhao, Hao, Wang, Lusheng
core +2 more sources
Random Structures & Algorithms, 2023 AbstractList coloring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list‐coloring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a ‐list‐assignment of a graph ,
Stijn Cambie +3 more
openaire +8 more sources
Counting packings of list-colorings of graphs
Enumerative Combinatorics and Applications11 ...
Hemanshu Kaul, Jeffrey A. Mudrock
doaj +3 more sources
CoRR, 2015 We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two items of the same color may be adjacent within in a bin. The goal is to perform this packing using the fewest number of bins.
Hamza Alsarhan +4 more
openaire +2 more sources
On Colorful Bin Packing Games [PDF]
, 2018 We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of $m\geq 2$ colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are ...
Vittorio Bilò +3 more
openaire +6 more sources
Online Colored Bin Packing [PDF]
, 2015 Added lower bound of 2.5 for at least three colors, expanded some ...
Martin Böhm 0001 +2 more
openaire +3 more sources
Packing coloring of graphs [PDF]
, 2022 Pakirno barvanje grafe je dobro barvanje vozlišč, pri katerem sta poljubni dve vozlišči z isto barvo i na razdalji večji kot i. Pakirno kromatično število je najmanjše število barv, ki jih potrebujemo za tako barvanje grafa.
Ličina, Tomaž
core
Performance characteristics of a new structured packing [PDF]
, 2010 A new structured packing using carbon fibres, called Sepcarb® 4D, is presented. This packing has several attractive properties, such as high voidage (ε=94%) and high effective area (a=420 m2 m−3).
Abbé, François +13 more
core +1 more source
, 2014 We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \in [0,1] and a color c_i \in C, where C is a set of colors (that is not necessarily known in advance).
György Dósa, Leah Epstein
openaire +3 more sources