Results 81 to 90 of about 946,691 (269)
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peled, Uri N., Rotics, Udi
openaire +1 more source
Advanced Science, EarlyView.Nap1l4a is required in erythropoiesis and hypoxia responses via physical interaction with Klf1 and Scl to recruit the histone variant H2A.Z. This facilitates its associated cis‐regulatory element (CRE) remodeling and the consequent chromatin assembly, and activates the transcription of erythroid lineage‐specific genes.
JiaHao Shi +10 more
wiley +1 more source
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2011 Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source
Clique Graphs of Chordal and Path Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1994 Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Szwarcfiter, Jayme L. +1 more
openaire +2 more sources
Carpathian Journal of Mathematics, 2021 Triangulated graphs have many interesting properties (perfection, recognition algorithms, combinatorial optimization algorithms with linear complexity). Hyper-triangulated graphs are those where each induced subgraph has a hyper-simplicial vertex. In this paper we give the characterizations of hyper-triangulated graphs using an ordering of vertices and
openaire +1 more source
Advanced Science, EarlyView.Schematic representation of ZIF‐8@OXA@inulin for cancer immunotherapy. Synthesis of ZIF‐8@OXA@inulin. Augmentation of pyroptosis, regulation of gut microbiota, and inhibition of NETs formation by ZIF‐8@OXA@inulin‐mediated comprehensive strategy for antitumor immune response. ABSTRACT Despite the potential of chemoimmunotherapy against colorectal cancer
Zhenhao Li +8 more
wiley +1 more source
Toughness and hamiltonicity in $k$-trees [PDF]
, 2001 We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$-trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there ...
Broersma, H.J., Xiong, L., Yoshimoto, K.
core +1 more source
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2014 An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing the set of ...
M. Kanté +4 more
semanticscholar +1 more source
Learning Inclusion-Optimal Chordal Graphs
, 2008 Appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence (UAI2008)
Auvray, Vincent, Wehenkel, Louis
openaire +3 more sources