Dually chordal graph
id:
dually-chordal-graph-196-11485461
title:
Dually chordal graph
text:
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. Unlike for chordal graphs, the property of being dually chordal is not hereditary, i.e., induced subgrap
brand slug:
wiki
category slug:
encyclopedia
description:
Graph whose maximal clique hypergraph is a hypertree
original url:
https://en.wikipedia.org/wiki/Dually_chordal_graph
date created:
date modified:
2024-01-15T12:38:11Z
main entity:
{"identifier":"Q25304852","url":"https://www.wikidata.org/entity/Q25304852"}
image:
fields total:
13
integrity:
14