Results 221 to 230 of about 946,691 (269)
Macrophage Membrane-Coated Liposomes Delivering Vonoprazan Disrupt Mitochondrial Oxidative Phosphorylation in Diffuse Large B-Cell Lymphoma. [PDF]
Int J NanomedicineWang W +11 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
International Workshop on Graph-Theoretic Concepts in Computer Science, 2021The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general graph isomorphism ...
V. Arvind +3 more
semanticscholar +1 more source
Well-partitioned chordal graphs: obstruction set and disjoint paths
International Workshop on Graph-Theoretic Concepts in Computer Science, 2020We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star structure, the leaves
Jungho Ahn +3 more
semanticscholar +1 more source
Regularity of binomial edge ideals of chordal graphs
Collectanea Mathematica, 2018In this paper we prove the conjectured upper bound for Castelnuovo–Mumford regularity of binomial edge ideals posed in [ 23 ], in the case of chordal graphs.
M. Rouzbahani Malayeri +2 more
semanticscholar +1 more source
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
International Symposium on Mathematical Foundations of Computer Science, 2018We give deterministic distributed $(1+\epsilon)$-approximation algorithms for Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the LOCAL model.
C. Konrad, V. Zamaraev
semanticscholar +1 more source
Chromaticity of Chordal Graphs
Graphs and Combinatorics, 1997A chordal graph is a graph that does not contain any induced cycle with length greater than 3. A polynomial \(P=\lambda^{m_0}(\lambda-1)^{m_1}\cdots (\lambda-k)^{m_k}\) is said to be a chordal polynomial, if for any graph \(G\), \(P(G,\lambda)=P\) implies \(G\) is a chordal graph. The main result of this paper is the following: If \(m_0=1\) and \(\sum_{
openaire +2 more sources
Clique Partitions of Chordal Graphs
Combinatorics, Probability and Computing, 1993To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.
Erdős, Paul +2 more
openaire +2 more sources
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
International Symposium on Algorithms and Computation, 2022Dibyayan Chakraborty +5 more
semanticscholar +1 more source