Results 11 to 20 of about 269,645 (235)
On distance dominator packing coloring in graphs
Discussiones Mathematicae Graph Theory, 2021 Let G be a graph and let S = (s1,s2,..., sk) be a non-decreasing sequence of positive integers. An S-packing coloring of G is a mapping c : V(G) ? {1, 2,..., k} with the following property: if c(u) = c(v) = i, then d(u,v) > si for any i ? {1, 2,...,k}.
Jasmina Ferme, D. Štesl
semanticscholar +3 more sources
Notes on complexity of packing coloring [PDF]
Information Processing Letters, 2017 A packing k-coloring for some integer k of a graph G = ( V , E ) is a mapping φ : V → { 1 , … , k } such that any two vertices u , v of color φ ( u ) = φ ( v ) are in distance at least φ ( u ) + 1 .
Minki Kim +3 more
semanticscholar +6 more sources
Modeling the packing coloring problem of graphs
Applied Mathematical Modelling, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zehui Shao, Aleksander Vesel
exaly +4 more sources
Algebraic and Combinatorial Algorithms for S-Packing Coloring
ACM Communications in Computer AlgebraS-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
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
Packing coloring of Sierpiński-type graphs [PDF]
Aequationes mathematicae, 2017 The packing chromatic number $χ_ρ(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in \{1,\ldots,k\}$, where each $V_i$ is an $i$-packing. In this paper, we consider the packing chromatic number of several families of Sierpiński-type graphs.
B. Brešar, Jasmina Ferme
semanticscholar +5 more sources
Counting packings of list-colorings of graphs
Enumerative Combinatorics and Applications11 ...
Hemanshu Kaul, Jeffrey A. Mudrock
doaj +3 more sources
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections [PDF]
Latin-American Algorithms, Graphs and Optimization Symposium, 2023 This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an upper bound of the competitive ratio of $FirstFit$ for OVBP.
Yaqiao Li, D. Pankratov
semanticscholar +1 more source
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 +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 +4 more sources