Results 71 to 80 of about 84,264 (306)
FEBS Open Bio, EarlyView.CAF‐mediated immunosuppression in ovarian cancer is driven by IDO1, reducing T‐cell function. Inhibiting IDO1 restores T‐cell proliferation and cytotoxicity, increases cancer cell apoptosis, and may help overcome CAF‐induced immune suppression in high‐grade serous ovarian cancer. Targeting IDO1 may improve antitumor immunity.
Hyewon Lee +3 more
wiley +1 more source
Bilangan Kromatik Permainan Graf Ubur-Ubur, Graf Siput, dan Graf Gurita
Jambura Journal of MathematicsGraph coloring is the process of assigning colors to the vertices or edges of a graph. Specifically, coloring the vertices in graph coloring can be implemented in graph coloring games.
M Luthfi Abdurahman +2 more
doaj +1 more source
Jurnal Ilmu Komputer dan Informasi, 2012 University Course Timetabling Problem merupakan proses penjadwalan mata kuliah di sebuah universitas yang hasilnya diusahakan seoptimal mungkin untuk tidak saling berbenturan dengan batasan-batasan dan syarat-syarat (constraints) tertentu.
Lely Hiryanto, Jacklin Sinthia Thio
doaj +1 more source
List-3-Coloring ordered graphs with a forbidden induced subgraph [PDF]
, 2022 Sepehr Hajebi, Yanjia Li, Sophie Spirkl
openalex +1 more source
FEBS Open Bio, EarlyView.This study addressed how a senior research thesis is perceived by undergraduate students. It assessed students' perception of research skills, epistemological beliefs, and career goals in Biochemistry (science) and BDC (science‐business) students. Completing a thesis improved confidence in research skills, resilience, scientific identity, closed gender‐
Celeste Suart +4 more
wiley +1 more source
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
Drawing Colored Graphs on Colored Points
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Badent M. +2 more
openaire +2 more sources
Batch Coloring of Graphs [PDF]
Algorithmica, 2017 In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input ...
Joan Boyar +4 more
openaire +5 more sources
Naked cuticle is essential for Drosophila wing development beyond Wingless signaling
FEBS Open Bio, EarlyView.Naked cuticle (Nkd), a Wnt signaling inhibitor, assumes extensive roles in Drosophila wing development. Overexpressing Nkd causes smaller, crumpled wings, while also perturbing multiple signaling pathways and developmental genes. A specific region (R1S) is critical for Nkd's function as a signaling integrator, offering new insights for studying its ...
Rui Wang, Ping Wang
wiley +1 more source
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj