بيان فِدَريّ
Sign in to saveAlso known as clique tree, block-clique graph, 1-chordal graph
connected graph whose biconnected components are all cliques
In the Vinony graph
Within Vinony's link graph, بيان فِدَريّ is referenced by 23 other articles, and connects out to approximation algorithm, digital object identifier and Paul Erdős.
It sits within the topics Graph families, Intersection classes of graphs and Perfect graphs.
Its subject is documented across 5 Wikipedia language editions.
Wikidata facts
- Subclass of
- undirected graph
- Image
- Block graph.svg
Show 2 more facts
- studied by
- graph theory
- has characteristic
- boxicity
Sources (2)
via Wikidata · CC0
Connections
approximation algorithm
Entity
digital object identifier
Entity
Paul Erdős
Entity
graph theory
Entity
graph
Entity
if and only if
Entity
bar chart
Entity
tree
Entity
Semantic Scholar
Entity
planar graph
Entity
time complexity
Entity
Handle System
Entity
block diagram
Entity
Mathematical Reviews
Entity
shortest path problem
Entity
clique
Entity
Vera T. Sós
Entity
line graph
Entity
chordal graph
Entity
perfect graph
Entity