rigid circuit graphs or triangulated graphs: a chordal completion of a graph is typically called a triangulation of that graph. Chordal graphs are a subset...

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

strongly chordal graph is a chordal graph in which every even cycle of length six or more has an odd chord. 5.  A strongly perfect graph is a graph in...

closely related to strongly chordal graphs. By definition, chordal bipartite graphs have a forbidden subgraph characterization as the graphs that do not contain...

dually chordal (hereditarily dually chordal graphs are exactly the strongly chordal graphs), and a dually chordal graph is in general not a perfect graph. Dually...

characterization of interval graphs as AT-free chordal graphs, interval graphs are strongly chordal graphs and hence perfect graphs. Their complements belong...

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

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

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

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

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

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

polynomial time. Famous examples are claw-free graphs, P5-free graphs and perfect graphs. For chordal graphs, a maximum weight independent set can be found...

bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...

are strongly chordal, it follows that leaf powers are strongly chordal graphs. Actually, leaf powers form a proper subclass of strongly chordal graphs; a...

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

classes of graphs, such as forests, chordal graphs, cycles, wheels, and ladders, so these can be evaluated in polynomial time. If the graph is planar and...

Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De...

more commonly refer to the line graph of a complete graph and to the chordal graphs respectively. Every maximal planar graph on more than 3 vertices is at...

permutation graph of a separable permutation. A cograph is a graph all of whose minimal chordal completions are trivially perfect graphs. A cograph is...

his papers is tree structure of graphs and hypergraphs such as for hypertrees, strongly chordal graphs and chordal graphs. He frequently took part in program...

intersection graph of line segments (the chords of a circle), is also a string graph. Every chordal graph may be represented as a string graph: chordal graphs are...

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

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

there exist infinite chordal graphs, and even infinite chordal graphs of diameter two, that are not cop-win. For other types of graphs, there may exist infinite...

"On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs", Theoretical Computer Science, 381 (1–3): 57–67...

chordal graphs, because the squares of line graphs of chordal graphs are perfect graphs. Moreover, it can be solved in linear time in chordal graphs ...

structural cohesion. If a graph has treewidth or pathwidth at most k {\displaystyle k} , then it is a subgraph of a chordal graph which has a perfect elimination...

Bartier, Valentin (2019). "Linear Transformations Between Colorings in Chordal Graphs". In Bender, Michael A.; Svensson, Ola; Herman, Grzegorz (eds.). 27th...

three. The cographs are exactly the graphs with no induced path of length three. The chordal graphs are the graphs with no induced cycle of length four...