Results 81 to 90 of about 652,005 (320)
Informatika, 2018 A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj
A Note on Graphs of Linear Rank-Width 1 [PDF]
, 2013 We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear rank-width at ...
Bui-Xuan, Binh-Minh +2 more
core
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
Recognizing Perfect 2-Split Graphs
SIAM Journal on Discrete Mathematics, 2000 A graph is said to be a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a \(k\)-split graph if its vertices can be partitioned into \(k\) sets, each of which induces a split graph. It is proved that the strong perfect graph conjecture is true for 2-split graphs, and a polynomial algorithm for recognizing a ...
Hoàng, Chính T., Le, Van Bang
openaire +2 more sources
Molecular Oncology, EarlyView.Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
Inhibition of CDK9 enhances AML cell death induced by combined venetoclax and azacitidine
Molecular Oncology, EarlyView.The CDK9 inhibitor AZD4573 downregulates c‐MYC and MCL‐1 to induce death of cytarabine (AraC)‐resistant AML cells. This enhances VEN + AZA‐induced cell death significantly more than any combination of two of the three drugs in AraC‐resistant AML cells.
Shuangshuang Wu +18 more
wiley +1 more source
On forbidden subgraphs of main supergraphs of groups
Electronic Research ArchiveIn this study, we explore the main supergraph $ \mathcal{S}(G) $ of a finite group $ G $, defined as an undirected, simple graph with a vertex set $ G $ in which two distinct vertices, $ a $ and $ b $, are adjacent in $ \mathcal{S}(G) $ if the order of ...
Xiaoyan Xu +3 more
doaj +1 more source
Moving to Extremal Graph Parameters [PDF]
, 2013 Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters:
Cameron, P. J. +2 more
core
Intrinsically linked graphs and even linking number
, 2005 We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with
Alexander Diesl, Sachs, Thomas Fleming
core +3 more sources
Retractions of split graphs and End-orthodox split graphs
Discrete Mathematics, 2002 A finite graph \(\Gamma\) is said to be split if its vertex set can be partitioned into two subsets \(K\) and \(I\), so that every pair of vertices of \(K\) is joined by an edge of \(\Gamma\), and no two vertices of \(I\) are. A monoid \(M\) is called regular if, given any \(a\in M\), there is an element \(b \in M\) so that \(aba=a\), and a regular ...
openaire +1 more source