Results 81 to 90 of about 168,763 (311)
Molecular Oncology, EarlyView.Targeted therapy was evaluated in SHH medulloblastoma using neuroepithelial stem cell (NES) and tumor‐derived NES‐like (tNES) models in 2D monolayers and 3D spheroids. PI3K, AKT, and CDK4/6 inhibitors had minimal effects in NES but markedly reduced viability and growth and induced apoptosis in tNES cells, revealing distinct therapeutic vulnerabilities.
Monika Lukoseviciute +4 more
wiley +1 more source
The graph minor theorem in topological combinatorics
, 2023 We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}.
Miyata, Dane, Ramos, Eric
core
Strong Edge Coloring of K4(t)-Minor Free Graphs
Axioms, 2023 A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Huixin Yin, Miaomiao Han, Murong Xu
doaj +1 more source
Cliques in Graphs Excluding a Complete Graph Minor [PDF]
The Electronic Journal of Combinatorics, 2016 This paper considers the following question: What is the maximum number of $k$-cliques in an $n$-vertex graph with no $K_t$-minor? This question generalises the extremal function for $K_t$-minors, which corresponds to the $k=2$ case. The exact answer is given for $t\leq 9$ and all values of $k$.
openaire +3 more sources
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
The Graph Minor Algorithm with Parity Conditions
, 2011 We generalize the seminal Graph Minor algorithm of Robertson and Seymour to the parity version. We give polynomial time algorithms for the following problems: 1) the parity H-minor (Odd K k-minor) containment problem, 2) the disjoint paths problem with k
Paul Wollan +4 more
core +1 more source
Quantum query complexity of minor-closed graph properties [PDF]
, 2011 We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an $n$-vertex graph is planar, is a forest, or does not contain a path of a given length. We show that most minor-closed properties
Andrew M. Childs +3 more
core +1 more source
Molecular Oncology, EarlyView.In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
Entire choosability of near-outerplane graphs
, 2008 It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington +2 more
core +1 more source
Counting Homomorphisms to K4-minor-free Graphs, modulo 2
, 2021 We study the problem of computing the parity of the number of homomorphisms from an input graph G to a fixed graph H. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph H and conjectured that, if satisfied, the problem is solvable ...
Stanislav Živný (17432607) +3 more
core +1 more source