Results 1 to 10 of about 269,595 (201)
Independence Number and Packing Coloring of Generalized Mycielski Graphs
Discussiones Mathematicae Graph Theory, 2021 For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(x) + 1 ...
Bidine Ez Zobair +2 more
doaj +2 more sources
Packing coloring of generalized Sierpinski graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $c$ such that the vertex set $V(G)$ can be partitioned into sets $X_1, . . .
Danilo Korze, Aleksander Vesel
doaj +3 more sources
Packing Coloring of Some Undirected and Oriented Coronae Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +2 more sources
Further results and questions on S-packing coloring of subcubic graphs
Discrete MathematicsFor non-decreasing sequence of integers $S=(a_1,a_2, \dots, a_k)$, an $S$-packing coloring of $G$ is a partition of $V(G)$ into $k$ subsets $V_1,V_2,\dots,V_k$ such that the distance between any two distinct vertices $x,y \in V_i$ is at least $a_{i}+1$, $
Olivier Togni
exaly +3 more sources
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$.
Petr Gregor +3 more
semanticscholar +1 more source
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
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
Discussiones Mathematicae Graph Theory, 2020 If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan +3 more
doaj +1 more source