Results 1 to 10 of about 1,020,170 (279)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]
Discrete Applied Mathematics, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Ryuhei Uehara
exaly +4 more sources
Connected graph searching in chordal graphs
Discrete Applied Mathematics, 2009 International audienceGraph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426--441]: given a “contaminated†graph G (e.g.,
Nicolas Nisse
exaly +4 more sources
Discrete Mathematics, 1994 We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We characterize those multigraphs which are squares of chordal graphs and include an algorithm to go from the squared chordal graph back
Harary, Frank, McKee, Terry A.
core +3 more sources
The clique-separator graph for chordal graphs
Discrete Applied Mathematics, 2009 We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional properties
Louis Ibarra
exaly +3 more sources
The Leafage Of A Chordal Graph
Discussiones Mathematicae Graph Theory, 1998 The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
West, Douglas +5 more
core +4 more sources
Chordal Graph Models of Contingency Tables
Computers and Mathematics With Applications, 1997 Chordal graph theory has recently found application by statisticians in the analysis of contingency tables. Specifically, what are called \u27\u27decomposable loglinear models\u27\u27 correspond exactly to chordal graphs.
McKee, T.A. +3 more
exaly +3 more sources
The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
International Journal of Approximate Reasoning, 2021 The integer linear programming approach to structural learning of decomposable graphical models led us earlier to the concept of a chordal graph polytope.
Milan Studený +2 more
exaly +2 more sources
Minimal Elimination Ordering Inside a Given Chordal Graph [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 1997 We consider the following problem, called Relative Minimal Elimination Ordering. Given a graph G=(V,E) which is a subgraph of the chordal graph G'=(V,E'), compute an inclusion minimal chordal graph G''=(V,E''), such that E subseteq E'' subseteq E'.
Dahlhaus, Elias
core +2 more sources
Powers of the vertex cover ideal of a chordal graph
, 2011 In this article, Cohen-Macaulay chordal graphs and generalized star graphs are studied to show that all powers of the vertex cover ideal of such graphs have linear quotients.
Mohammadi, Fatemeh, Fatemeh Mohammadi
core +2 more sources
Characterizations and algorithmic applications of chordal graph embeddings
Discrete Applied Mathematics, 1997 We introduce the separator graph for a given graph G and show a 1-1 correspondence between its maximal cliques and the minimal triangulations (i.e., ⊆-minimal chordal embeddings) of G.
Scheffler, Petra, Parra, Andreas
core +2 more sources