Results 181 to 190 of about 655,680 (212)
Some of the next articles are maybe not open access.

On the chordality of a graph

Journal of Graph Theory, 1993
Abstract The chordality of a graph G = ( V, E ) is defined as the minimum k such that we can write E =
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.
Andreas Brandstädt   +3 more
openaire   +4 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   +2 more
openaire   +2 more sources

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.
Paul D. Seymour, R. W. Weaver
openaire   +2 more sources

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

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.
Philippe Galinier   +2 more
openaire   +1 more source

Centers of chordal graphs

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

Retracts of products of chordal graphs

J. Graph Theory, 2013
Summary: In this article, we characterize the graphs \(G\) that are the retracts of Cartesian products of chordal graphs. We show that they are exactly the weakly modular graphs that do not contain \(K_{2, 3}\), the 4-wheel minus one spoke \(W_4^-\), and the \(k\)-wheels \(W_k\) (for \(k\geq 4\)) as induced subgraphs. We also show that these graphs \(G\
Bresar, Bostjan   +5 more
openaire   +4 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   +4 more sources

What Is between Chordal and Weakly Chordal Graphs?

2008
An (h ,s ,t )-representation of a graph G consists of a collection of subtrees {S v | v *** V (G )} of a tree T , such that (i) the maximum degree of T is at most h , (ii) every subtree has maximum degree at most s , and (iii) there is an edge between two vertices in the graph if and only if the corresponding subtrees in T have at least t vertices in ...
Elad Cohen   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy