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

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

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

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

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

which are also chordal. Just as chordal graphs are the intersection graphs of subtrees of trees, split graphs are the intersection graphs of distinct substars...

a subdivision of the complete graph K5 or the complete bipartite graph K3,3 (utility graph). A subdivision of a graph results from inserting vertices...

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

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

graph; perfect graphs include many well-known graph classes including the bipartite graphs, chordal graphs, and comparability graphs. In his 1961 and...

Perfect graphs include many important graphs classes including bipartite graphs, chordal graphs, and comparability graphs. The complement of a graph has an...

and the independent number α ( G ) {\displaystyle \alpha (G)} . In a bipartite graph with no isolated vertices, the number of vertices in a maximum independent...

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

Meyniel graphs contain the chordal graphs, the parity graphs, and their subclasses the interval graphs, distance-hereditary graphs, bipartite graphs, and...

unique smallest cubic graph of girth 8, it is a cage and a Moore graph. It is bipartite, and can be constructed as the Levi graph of the generalized quadrangle...

particular, there is a bipartite "incidence graph" or "Levi graph" corresponding to every hypergraph, and conversely, every bipartite graph can be regarded as...

twin operations preserve bipartiteness. Every bipartite distance-hereditary graph is chordal bipartite and modular. The graphs that can be built from a...

for the whole graph. The complete bipartite graphs are the only connected graphs whose Grundy number is two. All other connected graphs contain either...

bounded-degree planar graphs, split graphs, bipartite graphs and their complements, line graphs of bipartite graphs, unit disk graphs, interval graphs of diameter...

complete bipartite graph K3,3. For Kuratowski's theorem, the notion of containment is that of graph homeomorphism, in which a subdivision of one graph appears...

Petersen graph is nonplanar. Any nonplanar graph has as minors either the complete graph K 5 {\displaystyle K_{5}} , or the complete bipartite graph K 3 ...

graph are transitive. Every bipartite graph is also a comparability graph. Orienting the edges of a bipartite graph from one side of the bipartition to...

subgraphs bipartite Eulerian graphs bipartite regular graphs line graphs split graphs chordal graphs regular self-complementary graphs polytopal graphs of general...

that out of all bipartite graphs, crown graphs require longest word-representants? Is the line graph of a non-word-representable graph always non-word-representable...

This conjecture is known to hold for chordal bipartite graphs, bipartite series–parallel graphs, and bipartite graphs of maximum degree three. The conjecture...