Results 61 to 70 of about 10,361 (216)
On b-perfect Chordal Graphs [PDF]
Graphs and Combinatorics, 2009 The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Maffray, Frédéric, Mechebbek, Meriem
openaire +3 more sources
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
Treewidth of Chordal Bipartite Graphs [PDF]
Journal of Algorithms, 1993 Summary: Chordal bipartite graphs are exactly those bipartite graphs in which every cycle of length at least six has a chord. The treewidth of a graph \(G\) is the smallest maximum cliquesize among all chordal supergraphs of \(G\) decreased by one.
Kloks, A.J.J., Kratsch, D.
openaire +5 more sources
Advanced Science, EarlyView.In ankylosing spondylitis (AS), mechanical strain‐programmed SDC1+ sheath fibroblasts secrete CXCL5 to recruit neutrophils and promote the activation of CXCR4hi neutrophils, thereby exacerbating enthesitis by promoting neutrophil extracellular traps (NETs) formation. SOX5 controls the generation of SDC1+ sheath fibroblasts via super‐enhancers.
Jiajie Lin +13 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
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.Staphylococcus aureus (S. aureus) infection creates a high‐lactate microenvironment, promoting p300‐mediated lactylation of PGK1 at lysine 361 (K361). Lactylated PGK1 translocates to the mitochondrial outer membrane and interacts with VDAC3. This interaction triggers FtMt downregulation, iron accumulation, and excessive PINK1/Parkin‐mediated mitophagy,
Han‐jun Qin +5 more
wiley +1 more source
On a Class of Graphs with Large Total Domination Number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +1 more source
Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
Comptes Rendus. Mathématique, 2021 The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart quasi-polynomials into ...
Tran, Tan Nhat, Tsuchiya, Akiyoshi
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