area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has a chord, i.e., an...

graph is a chordal graph in which every cycle of length six or more has an odd chord. 4.  A chordal bipartite graph is not chordal (unless it is a forest);...

the interval graphs, and the maximal outerplanar graphs. The split graphs are exactly the graphs that are chordal and have a chordal complement. The...

of the bipartition of a complete bipartite graph, every vertex on the other side is a median. Every chordal bipartite graph (a class of graphs that includes...

subgraphs of chordal graphs are not necessarily chordal, so being a chordal graph is not monotone. A graph property is minor-closed if every graph minor of...

The graph sandwich problem is NP-complete when Π is the property of being a chordal graph, comparability graph, permutation graph, chordal bipartite graph...

area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in G has an odd chord, i.e...

of graph theory topics, by Wikipedia page. See glossary of graph theory terms for basic terminology Amalgamation Bipartite graph Complete bipartite graph...

graph is a forest. More advanced kinds of graphs are: Petersen graph and its generalizations; perfect graphs; cographs; chordal graphs; other graphs with...

cluster graph is a graph whose connected components are cliques. A block graph is a graph whose biconnected components are cliques. A chordal graph is a...