![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/2/25/Block_graph.svg/640px-Block_graph.svg.png&w=640&q=50)
Block graph
Graph whose biconnected components are all cliques / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Block graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Not to be confused with block diagram or bar chart.
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree[1] is a type of undirected graph in which every biconnected component (block) is a clique.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/2/25/Block_graph.svg/320px-Block_graph.svg.png)
Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi),[2] but that name more properly refers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle.[3]
Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs.[4]