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...

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...

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

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...

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

greater than three. A chordal graph, a special type of perfect graph, has no holes of any size greater than three. The girth of a graph is the length of its...

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

added while preserving outerplanarity, are also chordal graphs and visibility graphs. Outerplanar graphs were first studied and named by Chartrand & Harary...