Results 11 to 20 of about 4,092 (253)
Online Interval Coloring with Packing Constraints [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Meital Levy
openaire +3 more sources
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics, 2008 A packing \(k\)-colouring of a graph \(G=(V,E)\) is a list \((X_1, X_2, \dots, X_k)\) of sets with \(\bigcup_{i=1}^k X_i = V\), such that for every index \(i\) with \(1 \leq i \leq k\), every pair of different vertices \(u,v \in X_i\) has distance at least \(i\) in \(G\) [see \textit{B. Brešar}, \textit{S. Klavžar}, and \textit{D.F.
Jirí Fiala 0001, Petr A. Golovach
openaire +3 more sources
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianping Li 0007 +2 more
openaire +2 more sources
Every subcubic graph is packing (1,1,2,2,3)-colorable
Discrete Mathematics9 pages, 2 ...
Xujun Liu, Xin Zhang, Yanting Zhang
openaire +3 more sources
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
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 +7 more sources
Graphs that are Critical for the Packing Chromatic Number
Discussiones Mathematicae Graph Theory, 2022 Given a graph G, a coloring c : V (G) → {1, …, k} such that c(u) = c(v) = i implies that vertices u and v are at distance greater than i, is called a packing coloring of G.
Brešar Boštjan, Ferme Jasmina
doaj +1 more source
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
Be3Ru: Polar Multiatomic Bonding in the Closest Packing of Atoms
ChemistryOpen, 2022 The new phase Be3Ru crystallizes with TiCu3‐type structure (space group Pmmn (59), a=3.7062(1) Å, b=4.5353(1) Å, c=4.4170(1) Å), a coloring variant of the hexagonal closest packing (hcp) of spheres.
Laura Agnarelli +7 more
doaj +1 more source
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 +4 more sources