Results 21 to 30 of about 254,850 (275)

The Packing Coloring of Distance Graphs $D(k,t)$ [PDF]

Discrete Applied Mathematics, 2013
Jan Ekstein, Přemysl Holub, Olivier Togni   +2 more
openalex   +3 more sources

Sphere packing proper colorings of an expander graph [PDF]

IEEE Transactions on Information Theory
23 pages, 2 ...
Honglin Zhu
openalex   +4 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, Dr. Yurii Prots, Dr. Marcus Schmidt, Dr. Mitja Krnel, Dr. Eteri Svanidze, Dr. Ulrich Burkhardt, Dr. Andreas Leithe‐Jasper, Prof. Dr. Yuri Grin   +7 more
doaj   +1 more source

Packing $(1,1,2,2)$-coloring of some subcubic graphs [PDF]

, 2019
6 ...
Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu   +3 more
openalex   +4 more sources

Compressed Subsequence Matching and Packed Tree Coloring [PDF]

Algorithmica, 2014
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $ $, our algorithm uses $O(n+\frac{n }{w})$ space and $O(n+\frac{n }{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n }{w}\log w+m\log N\cdot occ)$ time.
Bille, Philip, Cording, Patrick Hagge, Gørtz, Inge Li   +2 more
openaire   +5 more sources

A Survey on Packing Colorings

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, Ferme Jasmina, Klavžar Sandi, Rall Douglas F.   +3 more
doaj   +1 more source

Packing Coloring of Hypercubes with Extended Hamming Codes

Discrete Applied Mathematics
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$. The least number of colors needed for a packing coloring of $G$ is called the {\em packing chromatic number} of $G$.
Petr Gregor, Jaka Kranjc, Borut Lužar, Kenny Štorgel   +3 more
openalex   +4 more sources

Online Colored Bin Packing [PDF]

, 2015
Comment: Added lower bound of 2.5 for at least three colors, expanded some ...
Böhm, Martin, Sgall, Jiří, Veselý, Pavel   +2 more
openaire   +3 more sources