Results 81 to 90 of about 93,098 (334)
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
FEBS Letters, EarlyView.At low cell density, SETDB1 and YAP1 accumulate in the nucleus. As cell density increases, the Hippo pathway is gradually activated, and SETDB1 is associated with increased YAP1 phosphorylation. At high cell density, phosphorylated YAP1 is sequestered in the cytoplasm, while SETDB1 becomes polyubiquitinated and degraded by the ubiquitin–proteasome ...
Jaemin Eom +3 more
wiley +1 more source
Molecular Oncology, EarlyView.This study indicates that Merkel cell carcinoma (MCC) does not originate from Merkel cells, and identifies gene, protein & cellular expression of immune‐linked and neuroendocrine markers in primary and metastatic Merkel cell carcinoma (MCC) tumor samples, linked to Merkel cell polyomavirus (MCPyV) status, with enrichment of B‐cell and other immune cell
Richie Jeremian +10 more
wiley +1 more source
Fuzzy Edge Chromatic Number of the Join of Fuzzy Graphs and Its Applications
AxiomsFuzzy edge coloring has proven to be a powerful tool for modeling and optimizing complex network systems, owing to its ability to effectively represent and manage the uncertainty in relational strengths and conflicts.
Jing Qu, Qian Wang, Angmo Deji
doaj +1 more source
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs [PDF]
, 2023 Sylvain Gravier +2 more
openalex +1 more source
The Relaxed Game Chromatic Index of \u3cem\u3ek\u3c/em\u3e-Degenerate Graphs [PDF]
, 2007 The (r, d)-relaxed coloring game is a two-player game played on the vertex set of a graph G. We consider a natural analogue to this game on the edge set of G called the (r, d)-relaxed edge-coloring game. We consider this game on trees and more generally,
Dunn, Charles
core +1 more source
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
, 2017 We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds.
Fischer, Manuela +2 more
core +1 more source
Molecular Oncology, EarlyView.Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
Solution of Vizing's Problem on Interchanges for Graphs with Maximum Degree 4 and Related Results [PDF]
, 2014 Let $G$ be a Class 1 graph with maximum degree $4$ and let $t\geq 5$ be an integer. We show that any proper $t$-edge coloring of $G$ can be transformed to any proper $4$-edge coloring of $G$ using only transformations on $2$-colored subgraphs (so-called ...
Asratian, Armen S. +1 more
core
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Molecular Oncology, EarlyView.Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source