Results 1 to 10 of about 3,662 (119)
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 +4 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
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 +3 more sources
Notes on complexity of packing coloring [PDF]
Information Processing Letters, 2018 9 pages, 2 ...
Minki Kim +2 more
exaly +5 more sources
Grundy packing coloring of graphs
Discrete Applied Mathematics16 pages, 5 figures, 6 tables, 37 ...
Didem Gözüpek, Iztok Peterin
exaly +4 more sources
Counting packings of list-colorings of graphs
Enumerative Combinatorics and Applications11 ...
Hemanshu Kaul, Jeffrey A. Mudrock
doaj +3 more sources
Packing Coloring of Some Undirected and Oriented Coronae Graphs
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 +4 more sources
Facial packing edge-coloring of plane graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julius Czap, Stanislav Jendrol’
exaly +2 more sources
Packing coloring of hypercubes with extended Hamming codes
Discrete Applied MathematicsA {\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$. The least number of colors needed for a packing coloring of $G$ is called the {\em packing chromatic number} of $G$.
Petr Gregor, Kenny Štorgel
exaly +4 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 +3 more sources