Results 101 to 110 of about 1,844,339 (310)
Depth and Stanley depth of edge ideals associated to some line graphs
AIMS Mathematics, 2019 School of Natural Sciences, National University of Sciences and Technology Islamabad, Sector H-12, Islamabad ...
Zahid Iqbal, Muhammad Ishaq
doaj +1 more source
The Journal of Symbolic LogicAbstract We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space.
JAMES ANDERSON, ANTON BERNSHTEYN
openaire +2 more sources
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
Molecular Oncology, EarlyView.GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Molecular Oncology, EarlyView.This study identifies nuclear YB‐1 S102 phosphorylation as a marker associated with KRAS and FBXW7 mutations in colorectal cancer. Mutated KRAS correlates specifically with nuclear, not cytoplasmic, S102 YB‐1. These findings provide the first ex vivo evidence of this link in CRC and suggest future studies should assess the prognostic and therapeutic ...
Konstanze Lettau +9 more
wiley +1 more source
ncRPI-LGAT: Prediction of ncRNA-protein interactions with line graph attention network framework. [PDF]
Comput Struct Biotechnol J, 2023 Han Y, Zhang SW.
europepmc +1 more source
Towards on-line Ohba's conjecture [PDF]
, 2012 The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is strictly larger for some graphs. In particular, there are graphs $G$ with $|V(G)
Kozik, Jakub, Micek, Piotr, Zhu, Xuding
core
Collapsible graphs and reductions of line graphs
Discrete Mathematics, 2009 AbstractA graph G is collapsible if for every even subset X⊆V(G), G has a subgraph Γ such that G−E(Γ) is connected and the set of odd-degree vertices of Γ is X. A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G.
Chen, Zhi-Hong +2 more
openaire +3 more sources
Molecular Oncology, EarlyView.C–C chemokine receptor type 9 (CCR9) is an immune checkpoint in pancreatic ductal adenocarcinoma (PDAC). Novel anti‐CCR9 antibody SRB2 was evaluated in combination with cytotoxic chemotherapy in PDAC cells, patient‐derived organoids, patient‐derived xenografts, and humanized mouse models.
Hannah G. McDonald +18 more
wiley +1 more source
Cogent EngineeringA graph’s b-coloring admits proper coloring and has the extra characteristic of having a dominating node in each color-class in the graph. [Formula: see text] the b-chromatic number, is the largest integer k for which G can be colored with k colors using
Foram Chandarana +5 more
doaj +1 more source
GENERAL APPROACH TO LINE GRAPHS OF GRAPHS
Demonstratio Mathematica, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zdzisław Skupień, Antoni Marczyk
openaire +2 more sources