Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4927193> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Q4927193 subject Q7007192.
- Q4927193 subject Q7217193.
- Q4927193 subject Q7217255.
- Q4927193 subject Q8551818.
- Q4927193 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.".
- Q4927193 thumbnail Block_graph.svg?width=300.
- Q4927193 wikiPageWikiLink Q1058754.
- Q4927193 wikiPageWikiLink Q1124595.
- Q4927193 wikiPageWikiLink Q11381109.
- Q4927193 wikiPageWikiLink Q1187620.
- Q4927193 wikiPageWikiLink Q131476.
- Q4927193 wikiPageWikiLink Q1322892.
- Q4927193 wikiPageWikiLink Q1378376.
- Q4927193 wikiPageWikiLink Q141488.
- Q4927193 wikiPageWikiLink Q15704639.
- Q4927193 wikiPageWikiLink Q1699014.
- Q4927193 wikiPageWikiLink Q2300244.
- Q4927193 wikiPageWikiLink Q230655.
- Q4927193 wikiPageWikiLink Q272735.
- Q4927193 wikiPageWikiLink Q3033506.
- Q4927193 wikiPageWikiLink Q3115555.
- Q4927193 wikiPageWikiLink Q3115592.
- Q4927193 wikiPageWikiLink Q3498041.
- Q4927193 wikiPageWikiLink Q4774922.
- Q4927193 wikiPageWikiLink Q4951712.
- Q4927193 wikiPageWikiLink Q5129750.
- Q4927193 wikiPageWikiLink Q5282847.
- Q4927193 wikiPageWikiLink Q5467387.
- Q4927193 wikiPageWikiLink Q7007192.
- Q4927193 wikiPageWikiLink Q7217193.
- Q4927193 wikiPageWikiLink Q7217255.
- Q4927193 wikiPageWikiLink Q761631.
- Q4927193 wikiPageWikiLink Q8024306.
- Q4927193 wikiPageWikiLink Q8551818.
- Q4927193 wikiPageWikiLink Q884718.
- Q4927193 type Thing.
- Q4927193 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.".
- Q4927193 label "Block graph".
- Q4927193 differentFrom Q1124595.
- Q4927193 differentFrom Q884718.
- Q4927193 depiction Block_graph.svg.