Results 21 to 30 of about 5,891 (239)
Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product
Abstract The coloring theory of graphs is an important part of graph theory research. The key problem of the coloring theory of graphs is to determine the coloring number of each kind of coloring. Traditional coloring concepts mainly include proper vertex coloring, proper edge coloring, proper total coloring, and so on.
Chuang Zhong, Shuangliang Tian
openaire +1 more source
On Rainbow Cycles and Proper Edge Colorings of Generalized Polygons
An edge coloring of a simple graph $G$ is said to be \textit{proper rainbow-cycle-forbidding} (PRCF, for short) if no two incident edges receive the same color and for any cycle in $G$, at least two edges of that cycle receive the same color. A graph $G$ is defined to be \textit{PRCF-good} if it admits a PRCF edge coloring, and $G$ is deemed \textit ...
openaire +4 more sources
We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj
Geodesic dominated coloring in certain product graphs
A geodesic dominated coloring of a graph G is a proper coloring in which each color class is dominated by at least one geodesic. The minimum number of colors required for such a coloring is the geodesic dominated chromatic number, denoted by χdomg(G). In
M. Paruvatha Vathana, R. Jayagopal
doaj +1 more source
ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Linear Hypergraph Edge Coloring - Generalizations of the EFL Conjecture [PDF]
Motivated by the Erdos-Faber-Lovász (EFL) conjecture for hypergraphs, we consider the edge coloring of linear hypergraphs. We discuss several conjectures for coloring linear hypergraphs that generalize both EFL and Vizing's theorem for graphs. For example, we conjecture that in a linear hypergraph of rank 3, the edge chromatic number is at most 2 ...
openaire +1 more source
Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes.
M Rosicka +6 more
doaj +1 more source
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas +6 more
wiley +1 more source

