Results 221 to 230 of about 4,092 (253)

Modeling Possible G-Quadruplexes and i-Motifs at DNA-DNA Contact Sites: Strategy, Classification, and Examples. [PDF]

Int J Mol Sci
Tsvetkov VB.
europepmc   +1 more source

Tracking the protein conformational motions driving HIV-1 membrane fusion. [PDF]

Sci Rep
Unarta IC, Crotzer S, Gnanakaran S.
europepmc   +1 more source

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   +3 more sources

About S-packing coloring of subcubic graphs

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

Dichotomies properties on computational complexity of S-packing coloring problems

Discrete Mathematics, 2015
International audienceThis work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s_1 , ..., s_k ), G is S-colorable, if its vertices ...
Nicolas Gastineau
exaly   +1 more source

S-packing coloring of cubic Halin graphs

Discrete Applied Mathematics
Given a non-decreasing sequence $S = (s_{1}, s_{2}, \ldots , s_{k})$ of positive integers, an $S$-packing coloring of a graph $G$ is a partition of the vertex set of $G$ into $k$ subsets $\{V_{1}, V_{2}, \ldots , V_{k}\}$ such that for each $1 \leq i ...
Olivier Togni
exaly   +2 more sources

Selfish colorful bin packing games

Journal of Combinatorial Optimization, 2020
The authors consider selfish colorful bin packing games in which a set of items, each one controlled by a selfish player, are to be packed into a minimum number of unit capacity bins. Each item has one of \(m \geq 2\) colors and no items of the same color may be adjacent in a bin.
Bilo V., Cellinese F., Melideo G., Monaco G.   +3 more
openaire   +5 more sources

Packing random items of three colors

Combinatorica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wansoo T. Rhee, Michel Talagrand
openaire   +2 more sources

On Packing and Coloring Hyperedges in a Cycle

2005
For a hypergraph and k different colors, we study the problem of packing and coloring some hyperedges of the hypergraph as paths in a cycle such that the total profit of the chosen hyperedges are maximized, here each link ej on the cycle is used at most cj times, each hyperedge hi has a profit pi and any two paths, each spanning all vertices of its ...
Jianping Li 0007, Kang Li, Ken C. K. Law, Hao Zhao   +3 more
openaire   +1 more source

Further results and questions on S-packing coloring of subcubic graphs

Discrete Mathematics
For 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   +2 more sources