| dbo:abstract |
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique. Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle. Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs. (en) En théorie des graphes, une branche des mathématiques combinatoires, un graphe de blocs ou arbre de cliques est un graphe non orienté dans lequel chaque composante biconnexe (ou « bloc ») est une clique. (fr) Блоковый граф (кликовое дерево) — вид неориентированного графа, в котором каждая компонента двусвязности (блок) является кликой. Блоковые графы можно описать графами пересечений блоков произвольных неориентированных графов. (ru) Блоковий граф (клікове дерево) — вид неорієнтованого графу, в якому кожна компонента двозв'язності (блок) є клікою. Блокові графи можна описати графами перетинів блоків довільних неорієнтованих графів. (uk) |
| dbo:thumbnail |
wiki-commons:Special:FilePath/Block_graph.svg?width=300 |
| dbo:wikiPageID |
29106883 (xsd:integer) |
| dbo:wikiPageLength |
8422 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1097315437 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Biconnected_component dbr:Antimatroid dbc:Graph_families dbc:Perfect_graphs dbr:Approximation_algorithm dbr:Undirected_graph dbr:Induced_path dbr:Induced_subgraph dbr:Kôdi_Husimi dbr:Ptolemaic_graph dbr:Connectivity_(graph_theory) dbr:Matroid_parity_problem dbr:Median_graph dbr:Geodetic_graph dbr:Cluster_graph dbr:Boxicity dbr:Line_graph dbr:Cactus_graph dbr:Shortest_path dbr:Claw-free_graph dbr:Clique_(graph_theory) dbr:Perfect_graph dbc:Trees_(graph_theory) dbr:Tree_(graph_theory) dbr:Windmill_graph dbr:Forbidden_graph_characterization dbr:Bar_chart dbr:Graph_theory dbr:Intersection_graph dbr:Chordal_graph dbr:Block_diagram dbc:Intersection_classes_of_graphs dbr:Diamond_graph dbr:Distance-hereditary_graph dbr:Planar_graph dbr:Polynomial_time dbr:Approximation_ratio dbr:Empty_graph dbr:If_and_only_if dbr:Planarization dbr:File:Block_graph.svg |
| dbp:wikiPageUsesTemplate |
dbt:Distinguish dbt:Math dbt:Mvar dbt:Reflist dbt:Short_description |
| dct:subject |
dbc:Graph_families dbc:Perfect_graphs dbc:Trees_(graph_theory) dbc:Intersection_classes_of_graphs |
| gold:hypernym |
dbr:Graph |
| rdf:type |
owl:Thing dbo:Software yago:Abstraction100002137 yago:Class107997703 yago:Collection107951464 yago:Communication100033020 yago:Graph107000195 yago:Group100031264 yago:WikicatIntersectionClassesOfGraphs yago:VisualCommunication106873252 yago:WikicatPerfectGraphs |
| rdfs:comment |
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique. Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle. Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs. (en) En théorie des graphes, une branche des mathématiques combinatoires, un graphe de blocs ou arbre de cliques est un graphe non orienté dans lequel chaque composante biconnexe (ou « bloc ») est une clique. (fr) Блоковый граф (кликовое дерево) — вид неориентированного графа, в котором каждая компонента двусвязности (блок) является кликой. Блоковые графы можно описать графами пересечений блоков произвольных неориентированных графов. (ru) Блоковий граф (клікове дерево) — вид неорієнтованого графу, в якому кожна компонента двозв'язності (блок) є клікою. Блокові графи можна описати графами перетинів блоків довільних неорієнтованих графів. (uk) |
| rdfs:label |
Block graph (en) Graphe de blocs (fr) Блоковый граф (ru) Блоковий граф (uk) |
| owl:sameAs |
freebase:Block graph yago-res:Block graph wikidata:Block graph dbpedia-fr:Block graph dbpedia-hu:Block graph dbpedia-ru:Block graph dbpedia-uk:Block graph https://global.dbpedia.org/id/4a6Nk |
| prov:wasDerivedFrom |
wikipedia-en:Block_graph?oldid=1097315437&ns=0 |
| foaf:depiction |
wiki-commons:Special:FilePath/Block_graph.svg |
| foaf:isPrimaryTopicOf |
wikipedia-en:Block_graph |
| is dbo:wikiPageWikiLink of |
dbr:Biconnected_component dbr:Induced_path dbr:Kôdi_Husimi dbr:Ptolemaic_graph dbr:Geodetic_graph dbr:Cluster_graph dbr:Glossary_of_graph_theory dbr:Line_graph dbr:Cactus_graph dbr:Clique_(graph_theory) dbr:Perfect_graph dbr:Windmill_graph dbr:Intersection_graph dbr:Chordal_graph dbr:Distance-hereditary_graph dbr:Bull_graph dbr:Metric_dimension_(graph_theory) dbr:Longest_path_problem |
| is foaf:primaryTopic of |
wikipedia-en:Block_graph |
