Results 101 to 110 of about 18,582 (315)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
Colored Homomorphisms of Colored Mixed Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaroslav Nesetril, André Raspaud
openaire +2 more sources
Facial graceful coloring of plane graphs [PDF]
Let \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +1 more source
BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi +11 more
wiley +1 more source
Summary: In this article, a new graph coloring, called the \(b_q\)-coloring, is introduced. A \(b_q\)-coloring of a graph \(G\) is a proper vertex coloring of \(G\) with \(k\) colors such that every color class \(c\) admits a set of vertices \(S\) of size at most \(q\) provided that every color except \(c\) appears in the neighborhood of \(S\). The aim
openaire +3 more sources
This article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring. [PDF]
Gimenez-Guzman JM +4 more
europepmc +1 more source

