Results 221 to 230 of about 1,930 (230)

Based on single-cell and transcriptome data, ferroptosis and the immunological landscape in osteosarcoma were discovered. [PDF]

Discov Oncol
Jiang Y, Song C, Yan J, Luo L, Gao S, Jiang F, Wei Z, Chen J, Liu Z, Ge J.   +9 more
europepmc   +1 more source

Efficacy of 2,4-Di-tert-butylphenol in Reducing Ralstonia solanacearum Virulence: Insights into the Underlying Mechanisms. [PDF]

ACS Omega
Yang L, Wang R, Lin W, Li B, Jin T, Weng Q, Zhang M, Liu P.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the chordality of a graph

Journal of Graph Theory, 1993
AbstractThe chordality of a graph G = (V, E) is defined as the minimum k such that we can write E = E1 ∩ … ∩ Ek with each (V, Ei) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result is that the chordality of a graph is at most its tree width.
Terry A. McKee, Edward R. Scheinerman
openaire   +2 more sources

Dually Chordal Graphs

SIAM Journal on Discrete Mathematics, 1994
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique hypergraphs which have the Helly property and whose line graph is chordal.
Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin, Andreas Brandstädt   +3 more
openaire   +2 more sources

On the Hyperbolicity of Chordal Graphs

Annals of Combinatorics, 2001
The hyperbolicity \( \delta^* \ge 0 \) of a metric space in Gromov's sense can be viewed as a measure of how "tree-like" the space is, since those spaces for which \( \delta^* = 0 \) holds are precisely the set of (metric) trees. Here, we show that any chordal graph equipped with the usual graph metric is in this sense reasonably tree-like.
Brinkmann, Gunnar, Koolen, Jack H., Moulton, V.   +2 more
openaire   +3 more sources

On hypergraph acyclicity and graph chordality

Information Processing Letters, 1988
Abstract Concepts of acyclicity in hypergraphs and chordality in graphs are related by showing that a hierarchy of well-studied classes of chordal graphs corresponds to the hierarchy of classes of acyclic hypergraphs studied in relational database theory (Fagin, 1983).
D'ATRI, Alessandro, MOSCARINI, Marina
openaire   +4 more sources

Centers of chordal graphs [PDF]

Graphs and Combinatorics, 1991
In a graphG = (V, E), theeccentricity e(S) of a subset S $$ \subseteq $$ ismax x ? V min y ? S d(x, y); ande(x) stands fore({x}). Thediameter ofG ismax x ? V e(x), theradius r(G) ofG ismin x ? V e(x) and theclique radius cr(G) ismin e(K) whereK runs over all cliques. Thecenter ofG is the subgraph induced byC(G), the set of all verticesx withe(x) = r(G).
openaire   +1 more source

Graph searching on chordal graphs

1996
Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Chin-Wen Ho, Sheng-Lung Peng, Chuan Yi Tang, Tsan-sheng Hsu, Ming-Tat Ko   +4 more
openaire   +1 more source

Chordal graphs and their clique graphs

1995
In the first part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied.
Michel Habib, Philippe Galinier, Christophe Paul   +2 more
openaire   +2 more sources

Chordal Graphs and Their Clique Graphs

INTERNATIONAL JOURNAL OF COMPUTING ALGORITHM, 2014
Arockia Aruldoss J, Kalaivani P
openaire   +2 more sources