Results 181 to 190 of about 552 (213)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ryuhei Uehara
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +1 more source
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 +1 more source
Clique Graphs of Chordal and Path Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1994 Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Jayme L Szwarcfiter
exaly +3 more sources
SIAM Journal on Discrete Mathematics, 1994
The authors give a unified framework for characterizations of graphs which are dual (in the sense of hypergraphs) to chordal graphs, in terms of neighborhood and clique hypergraphs. By using the hypergraph approach in a systematical way, new results are obtained, a part of previous results are generalized, and some of the proofs are simplified.
Andreas Brandstädt +3 more
openaire +2 more sources
The authors give a unified framework for characterizations of graphs which are dual (in the sense of hypergraphs) to chordal graphs, in terms of neighborhood and clique hypergraphs. By using the hypergraph approach in a systematical way, new results are obtained, a part of previous results are generalized, and some of the proofs are simplified.
Andreas Brandstädt +3 more
openaire +2 more sources
On the Hyperbolicity of Chordal Graphs
Annals of Combinatorics, 2001The 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.
Jack H Koolen, V Moulton
exaly +3 more sources
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs [PDF]
Journal of Combinatorial Optimization, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marthe Bonamy +2 more
exaly +4 more sources
A generalization of chordal graphs
Journal of Graph Theory, 1984AbstractIn 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 +1 more source
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Terry A Mckee
exaly +3 more sources
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
Chordal graphs and their clique graphs
1995In 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