Graph whose maximal clique hypergraph is a hypertree
In the mathematical area of graph theory, an undirected graph G is dually chordal if the hypergraph of its maximal cliques is a hypertree. The name comes from the fact that a graph is chordal if and only if the hypergraph of its maximal cliques is the dual of a hypertree. Originally, these graphs were defined by maximum neighborhood orderings and have a variety of different characterizations.[1] Unlike for chordal graphs, the property of being dually chordal is not hereditary, i.e., induced subgraphs of a dually chordal graph are not necessarily 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 chordal graphs appeared first under the name HT-graphs.[2]
^Brandstädt et al. (1998); Brandstädt, Le & Spinrad (1999)
dually chordal (hereditarily duallychordalgraphs are exactly the strongly chordalgraphs), and a duallychordalgraph is in general not a perfect graph. Dually...
weakly chordal and bipartite since chordal bipartite graphs are in general not chordal as the induced cycle of length 4 shows. Chordal bipartite graphs have...
area of graph theory, an undirected graph G is strongly chordal if it is a chordalgraph and every cycle of even length (≥ 6) in G has an odd chord, i.e...
strongly chordalgraph is a chordalgraph in which every even cycle of length six or more has an odd chord. 5. A strongly perfect graph is a graph in which...
faces, so maximal planar graphs are strangulated. The strangulated graphs include also the chordalgraphs, and are exactly the graphs that can be formed by...
hypertrees but remains NP-complete for alpha-acyclic hypergraphs. Duallychordalgraph, a graph whose maximal cliques form a hypertree Brandstädt et al. (1998)...
added while preserving outerplanarity, are also chordalgraphs and visibility graphs. Outerplanar graphs were first studied and named by Chartrand & Harary...
the interval graphs, and the maximal outerplanar graphs. The split graphs are exactly the graphs that are chordal and have a chordal complement. The...
classes of graphs, such as forests, chordalgraphs, cycles, wheels, and ladders, so these can be evaluated in polynomial time. If the graph is planar and...
the primal graph is covered by some hyperedge) and its primal graph being chordal; it is also equivalent to reducibility to the empty graph through the...
mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...
for the problem exists if: the primal graph is chordal; the variables of every maximal clique of the primal graph are the scope of a constraint and vice...
parallel to another plane that is tangential to the conical surface. The graph of a quadratic function y = a x 2 + b x + c {\displaystyle y=ax^{2}+bx+c}...
Interval graphs are exactly the graphs that are chordal and that have comparability graph complements. A permutation graph is a containment graph on a set...
(1988). Gustedt (1993). Kloks, Kratsch & Müller (1995). A chordal domino is a chordalgraph in which every vertex belongs to at most two maximal cliques...
beginning at the upper right corner and going down or left. A k-tree is a chordalgraph with exactly n − k maximal cliques, each containing k + 1 vertices;...
are the chordal maximal planar graphs, the chordal polyhedral graphs, and the planar 3-trees. They are the uniquely 4-colorable planar graphs, and the...
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...
an example of the Platonic solid and of the deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron. Many polyhedrons are constructed...
breadth-first search, a graph search algorithm with applications in the recognition of chordalgraphs and several other important classes of graphs. Again, the disjoint...
major second can be found half way the major third. The Tonnetz is the dualgraph of Schoenberg's chart of the regions, and of course vice versa. Research...
In graph theory, all graphs with four or fewer vertices are planar, however, there is a graph with five vertices that is not: K5, the complete graph with...
Global Information