Results 81 to 90 of about 14,237 (338)
PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS
Tạp chí Khoa học Đại học Đà Lạt, 2020 Let G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph.
Lê Xuân Hùng
doaj +1 more source
On List-Coloring and the Sum List Chromatic Number of Graphs.
, 2011 This thesis explores several of the major results in list-coloring in an expository fashion. As a specialization of list coloring, the sum list chromatic number is explored in detail.
Hall, Coleman
core +1 more source
Molecular Oncology, EarlyView.Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau +8 more
wiley +1 more source
Choice Numbers of Multi-Bridge Graphs [PDF]
Computer Science Journal of Moldova, 2017 Suppose $ch(G)$ and $\chi(G)$ denote, respectively, the choice number and the chromatic number of a graph $G=(V,E)$. If $ch(G)=\chi(G)$, then $G$ is said to be chromatic-choosable.
Julian Allagan, Benkam Bobga
doaj
Journal of Natural Fibers, 2023 Environmental awareness has become more important among individuals and societies in recent years. The increasing awareness and sensitivity to the environment have made the reintroduction of natural dyes in the textile industries even more important.
Recep Karadag
doaj +1 more source
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
List Coloring in the Absence of Two Subgraphs [PDF]
, 2013 list assignment of a graph G = (V;E) is a function L that assigns a list L(u) of so-called admissible colors to each u 2 V . The List Coloring problem is that of testing whether a given graph G = (V;E) has a coloring c that respects a given list ...
Paulusma, D. +4 more
core +1 more source
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
, 2023 International audienceIn the past various distance based colorings on planar graphs were introduced. We turn our focus to three of them, namely 2-distance coloring, injective coloring, and exact square coloring. A 2-distance coloring is a proper coloring
La, Xuan Hoang, Štorgel, Kenny
core +1 more source
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Sum List Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G = (V,E) be a simple graph and for every edge e ∈ E let L(e) be a set (list) of available colors. The graph G is called L-edge colorable if there is a proper edge coloring c of G with c(e) ∈ L(e) for all e ∈ E. A function f : E → ℕ is called an edge
Kemnitz Arnfried +2 more
doaj +1 more source