Results 261 to 270 of about 908,928 (292)

Integrating multi-omics and experimental techniques to decode ubiquitinated protein modifications in hepatocellular carcinoma. [PDF]

Front Pharmacol
Yang H, Chen Y, Zhou Z, Wang Y, Li P, Li Y.   +5 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

On the Hyperbolicity of Chordal Graphs

Annals of Combinatorics, 2001
The hyperbolicity of a metric space is the infimum of all \(\delta\) for which \(d(x,y)+ d(u,v)\leq \max\{d(x, u)+ d(y,v), d(x,v)+ d(y,u)\}+ \delta\) for all elements \(x\), \(y\), \(u\), \(v\) from the space. The notion can be viewed as expressing how `tree like' the space is, as spaces with hyperbolicity \(0\) are precisely the metric trees.
Brinkmann, Gunnar, Koolen, Jack H., Moulton, V.   +2 more
openaire   +3 more sources

Centers of chordal graphs [PDF]

Graphs and Combinatorics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Rotation Averaging with the Chordal Distance: Global Minimizers and Strong Duality

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of applications.
Anders P. Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin   +3 more
semanticscholar   +1 more source

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

International Workshop on Graph-Theoretic Concepts in Computer Science, 2021
The 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, R. Nedela, I. Ponomarenko, Peter Zeman   +3 more
semanticscholar   +1 more source

A generalization of chordal graphs

Journal of Graph Theory, 1984
AbstractIn a 3‐connected planar triangulation, every circuit of length ≥ 4 divides the rest of the edges into two nontrivial parts (inside and outside) which are “separated” by the circuit. Neil Robertson asked to what extent triangulations are characterized by this property, and conjectured an answer.
R. W. Weaver, Paul Seymour
openaire   +2 more sources

4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected

Journal of Graph Theory
Tutte proved that 4‐connected planar graphs are Hamiltonian. It is unknown if there is an analogous result on 1‐planar graphs. In this paper, we characterize 4‐connected 1‐planar chordal graphs and show that all such graphs are Hamiltonian‐connected.
Licheng Zhang, Yuanqiu Huang, Shengxiang Lv, Fengming Dong   +3 more
semanticscholar   +1 more source

Chromaticity of Chordal Graphs

Graphs and Combinatorics, 1997
A 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   +3 more sources

On hypergraph acyclicity and graph chordality

Information Processing Letters, 1988
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 [\textit{R. Fagin}, J. Assoc. Comput. Mach. 30, 514-550 (1983; Zbl 0624.68088)].
D'ATRI, Alessandro, MOSCARINI, Marina
openaire   +5 more sources