Results 71 to 80 of about 254,850 (275)
Packing edge-colorings of subcubic outerplanar graphs [PDF]
For a sequence $S = (s_1, s_2, \ldots, s_k)$ of non-decreasing positive integers, an $S$-packing edge-coloring (S-coloring) of a graph $G$ is a partition of $E(G)$ into $E_1, E_2, \ldots, E_k$ such that the distance between each pair of distinct edges $e_1,e_2 \in E_i$, $1 \le i \le k$, is at least $s_i + 1$.
S. Li, Yifan Li, Xujun Liu
openalex +3 more sources
Every subcubic graph is packing (1,1,2,2,3)-colorable
9 pages, 2 ...
Xujun Liu, Xin Zhang, Yanting Zhang
openaire +2 more sources
Bin Packing with Multiple Colors
In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the case where there are two or more colors when the items have zero weight and when the items have unit weight.
Alsarhan, Hamza +4 more
openaire +2 more sources
In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source
Complexity of the packing coloring problem for trees
A packing \(k\)-colouring of a graph \(G=(V,E)\) is a list \((X_1, X_2, \dots, X_k)\) of sets with \(\bigcup_{i=1}^k X_i = V\), such that for every index \(i\) with \(1 \leq i \leq k\), every pair of different vertices \(u,v \in X_i\) has distance at least \(i\) in \(G\) [see \textit{B. Brešar}, \textit{S. Klavžar}, and \textit{D.F.
Fiala, Jiří, Golovach, Petr A.
openaire +2 more sources
Coloring, packing and embedding of graphs
Cette thèse se situe dans le domaine de graphes et de leurs applications, Elleest constitué de trois grandes parties, la première est consacrée à l’étude d’unnouveau type de coloration sommets distinguantes, les arête-colorations sommetsdistinguantespar écarte.
Mohammed Amin Tahraoui
openalex +3 more sources
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
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
This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source
In this paper, we introduce a new concept in graph coloring, namely the \textit{packing total coloring}, which extends the idea of packing coloring to both the vertices and the edges of a given graph. More precisely, for a graph $G$, a packing total coloring is a mapping $c: V(G) \cup E(G) \rightarrow \{1, 2, \ldots\}$ with the property that for any ...
Ferme, Jasmina, Štesl, Daša Mesarič
openaire +2 more sources
Aggressive prostate cancer is associated with pericyte dysfunction
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source

