Results 141 to 150 of about 51,213 (189)
Unravelling infiltrating T-cell heterogeneity in kidney renal clear cell carcinoma: Integrative single-cell and spatial transcriptomic profiling. [PDF]
J Cell Mol MedChen H +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Odd twists on strongly chordal graphs
Discrete Mathematics, Algorithms and Applications, 2019Strongly chordal graphs can be characterized as chordal graphs in which every even cycle of length at least [Formula: see text] has an odd chord (a chord whose endpoints are an odd distance apart in the cycle subgraph).
T. McKee
semanticscholar +2 more sources
Characterizing s-strongly chordal bipartite graphs
Utilitas MathematicaThe strongly chordal graph literature has recently expanded to include the sequentially smaller classes of \(s\)-strongly chordal graphs for \(s = 1, 2, 3,\ldots\) (and the limiting class of majorly chordal graphs).
Terry A. McKee
semanticscholar +2 more sources
Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
arXiv.orgIn his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''.
Therese Biedl
semanticscholar +3 more sources
Algorithms for Generating Strongly Chordal Graphs
IFIP International Conference on Theoretical Computer Science, 2021Graph generation serves many useful purposes: cataloguing, testing conjectures, to which we would like to add that of producing test instances for graph algorithms. Strongly chordal graphs are a subclass of chordal graphs for which polynomial-time algorithms could be designed for problems which are NP-complete for the parent class of chordal graphs. In
A. Mukhopadhyay, Md. Zamilur Rahman
semanticscholar +2 more sources
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs [PDF]
Combinatorica, 2006 A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal-Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented.
J. Herzog +4 more
semanticscholar +4 more sources
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs [PDF]
FAW-AAIM, 2011 Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W .
T. Kloks +3 more
semanticscholar +3 more sources