Results 1 to 10 of about 1,050,148 (230)
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 +3 more sources
Connected graph searching in chordal graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Nisse
exaly +3 more sources
Edge erasures and chordal graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +4 more sources
Discrete Mathematics, 1994 The authors characterize those multigraphs which are squares of chordal graphs and develop an algorithm for producing the unique square root from its squared chordal graph.
F. Harary, T. McKee
semanticscholar +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.
In-Jen Lin, T. McKee, D. West
semanticscholar +3 more sources
On chordal graph and line graph squares [PDF]
Discrete Applied Mathematics, 2018 In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Sebastian Wiederrecht
exaly +3 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 “decomposable loglinear models” correspond exactly to chordal graphs.
H. Khamis, T. McKee
exaly +2 more sources
The Neighborhood Polynomial of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor.
Helena Bergold +2 more
doaj +1 more source
The clique-separator graph for chordal graphs
Discrete Applied Mathematics, 2009 Louis Ibarra
exaly +2 more sources
Generating and characterizing the perfect elimination orderings of a chordal graph
Theoretical Computer Science, 2003 F Ruskey
exaly +2 more sources