Results 191 to 200 of about 269,645 (235)

Design Space and Declarative Grammar for 3D Genomic Data Visualization. [PDF]

IEEE Trans Vis Comput Graph
Kouril D, Manz T, L'Yi S, Gehlenborg N.
europepmc   +1 more source

Novel Extended Tetraether Lipids Found in a High-CO ₂ Geyser

Groninga J, Wittig L, Bouderka F, Bornemann TLV, Lipp JS, Schubotz F, Keden S, Probst AJ, Hinrichs K.   +8 more
europepmc   +1 more source

Grundy packing coloring of graphs

Discrete Applied Mathematics
A map $c:V(G)\rightarrow\{1,\dots,k\}$ of a graph $G$ is a packing $k$-coloring if every two different vertices of the same color $i\in \{1,\dots,k\}$ are at distance more than $i$.
Iztok Peterin
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Partial packing coloring and quasi-packing coloring of the triangular grid

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konstanty Junosza-Szaniawski
exaly   +4 more sources

About S-packing coloring of subcubic graphs

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olivier Togni
exaly   +3 more sources

Distance dominator packing coloring of type II

Quaestiones Mathematicae
In 2021, we introduced one type of the generalization of dominator coloring via packing coloring and distance domination. In this paper, we present a second type of such generalization, namely distance dominator packing coloring of type II, defined as ...
Jasmina Ferme, D. Štesl
exaly   +2 more sources

Fast algorithm for S-packing coloring of Halin graphs

CoRR
Motivated by frequency assignment problems in wireless broadcast networks, Goddard, Hedetniemi, Hedetniemi, Harris, and Rall introduced the notion of $S$-packing coloring in 2008.
Xin Zhang, Dezhi Zou
semanticscholar   +4 more sources

On packing coloring of helm related graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
The packing chromatic number χ p of a graph G is the smallest integer k for which there exists a mapping π: V(G) → {1, 2 … , k} such that any two vertices of color i are at distance at least i + 1.
M Venkatachalam
exaly   +2 more sources

On the packing coloring of base-3 Sierpiński graphs and H-graphs

Aequationes Mathematicae, 2020
Fei Deng, Zehui Shao, Aleksander Vesel   +2 more
exaly   +3 more sources

A set packing model for the Partition Coloring Problem

Carpathian Journal of Mathematics
In this paper we propose a set packing model for the Partition Coloring Problem (PCP) a gener alization of the Vertex Coloring Problem (VCP). Given a graph whose vertex set is partitioned in clusters, PCP aims to select one vertex from each cluster such
E. F. Olariu, C. Frasinaru
semanticscholar   +2 more sources