Results 81 to 90 of about 44,462 (291)
Single Valued Neutrosophic Coloring [PDF]
Neutrosophic Sets and Systems, 2019 Neutrosophic set was introduced by Smarandache in 1998. Due to some real time situation, decision makers deal with uncertainty and inconsistency to identify the best result.
A. Rohini +3 more
doaj +1 more source
FEBS Letters, EarlyView.Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley +1 more source
Edge Coloring by Total Labelings of 4-regular Circulant Graphs. [PDF]
, 2013 International audienceEdge-coloring total $k$-labeling of a connected graph $G$ is an assignment $f$ of non negative integers to the vertices and edges of $G$ such that two adjacent edges $e=uv$ and $e'=uv'$ of $G$ have different weights.
Khennoufa, Riadh, Seba, Hamida
core +4 more sources
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Discrete Dynamics in Nature and Society, 2020 A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Total coloring of planar graphs without some chordal 6-cycles [PDF]
, 2012 A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color.
Huijuan Wang, Jianliang Wu, Renyu Xu
core
Total Coloring for some classes of Cayley graphs [PDF]
, 2020 The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.Comment: 11 ...
K, Somasundaram +2 more
core +1 more source
Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions
FEBS Letters, EarlyView.The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang +4 more
wiley +1 more source
Researches on the coloring of multigraphs [PDF]
Given a loopless multigraph $G$ and a vertex-function $f\ : \ V(G) \rightarrow \mathbb{N}\backslash \{0\}$, an {\bf $f$-(edge)-coloring} of $G$ is an assignment of colors to the edges of $G$ such that each color appears at each vertex $v\in V(G)$ at most
Hao, Yanli
core +2 more sources
FEBS Letters, EarlyView.The mycobacterial CIII‐CIV respiratory supercomplex is an obligate assembly, encompassing several subunits of unknown functions. We have characterized the intracellular subunit AscF, and show that it is unlikely to be a sensor for metals or nucleotides, but is required for growth on nonfermentable energy sources, and likely works as an adapter for ...
Eni Rile +8 more
wiley +1 more source