Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5141281> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples per page.
- Q5141281 subject Q7007192.
- Q5141281 subject Q7217193.
- Q5141281 subject Q8498915.
- Q5141281 abstract "In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K1 and is closed under complementation and disjoint union.Cographs have been discovered independently by several authors since the 1970s; early references include Jung (1978), Lerchs (1971), Seinsche (1974), and Sumner (1974). They have also been called D*-graphs, hereditary Dacey graphs (after the related work of James C. Dacey, Jr. on orthomodular lattices), and 2-parity graphs.They have a simple structural decomposition involving disjoint union and complement graph operations that can be represented concisely by a labeled tree, and used algorithmically to efficiently solve many problems such as finding the maximum clique that are hard on more general graph classes.Special cases of the cographs include the complete graphs, complete bipartite graphs, and threshold graphs. The cographs are, in turn, special cases of the distance-hereditary graphs, comparability graphs, and perfect graphs.".
- Q5141281 thumbnail Turan_13-4.svg?width=300.
- Q5141281 wikiPageExternalLink www.graphclasses.org.
- Q5141281 wikiPageExternalLink gc_151.html.
- Q5141281 wikiPageExternalLink DAM-cographs.pdf.
- Q5141281 wikiPageWikiLink Q1028355.
- Q5141281 wikiPageWikiLink Q1058754.
- Q5141281 wikiPageWikiLink Q1101814.
- Q5141281 wikiPageWikiLink Q1187620.
- Q5141281 wikiPageWikiLink Q1196873.
- Q5141281 wikiPageWikiLink Q129239.
- Q5141281 wikiPageWikiLink Q130901.
- Q5141281 wikiPageWikiLink Q131476.
- Q5141281 wikiPageWikiLink Q141488.
- Q5141281 wikiPageWikiLink Q1415372.
- Q5141281 wikiPageWikiLink Q15704639.
- Q5141281 wikiPageWikiLink Q215206.
- Q5141281 wikiPageWikiLink Q2742711.
- Q5141281 wikiPageWikiLink Q2894153.
- Q5141281 wikiPageWikiLink Q2997928.
- Q5141281 wikiPageWikiLink Q303100.
- Q5141281 wikiPageWikiLink Q3186905.
- Q5141281 wikiPageWikiLink Q3527100.
- Q5141281 wikiPageWikiLink Q4312352.
- Q5141281 wikiPageWikiLink Q45715.
- Q5141281 wikiPageWikiLink Q474715.
- Q5141281 wikiPageWikiLink Q504843.
- Q5141281 wikiPageWikiLink Q5155607.
- Q5141281 wikiPageWikiLink Q5156434.
- Q5141281 wikiPageWikiLink Q5282847.
- Q5141281 wikiPageWikiLink Q5467387.
- Q5141281 wikiPageWikiLink Q547823.
- Q5141281 wikiPageWikiLink Q5808319.
- Q5141281 wikiPageWikiLink Q6295265.
- Q5141281 wikiPageWikiLink Q6504471.
- Q5141281 wikiPageWikiLink Q6889712.
- Q5141281 wikiPageWikiLink Q7007192.
- Q5141281 wikiPageWikiLink Q7140650.
- Q5141281 wikiPageWikiLink Q7169369.
- Q5141281 wikiPageWikiLink Q720459.
- Q5141281 wikiPageWikiLink Q7217193.
- Q5141281 wikiPageWikiLink Q7390256.
- Q5141281 wikiPageWikiLink Q7390263.
- Q5141281 wikiPageWikiLink Q7451767.
- Q5141281 wikiPageWikiLink Q7454786.
- Q5141281 wikiPageWikiLink Q761631.
- Q5141281 wikiPageWikiLink Q7844666.
- Q5141281 wikiPageWikiLink Q7888149.
- Q5141281 wikiPageWikiLink Q842620.
- Q5141281 wikiPageWikiLink Q8498915.
- Q5141281 wikiPageWikiLink Q902252.
- Q5141281 wikiPageWikiLink Q913598.
- Q5141281 wikiPageWikiLink Q943345.
- Q5141281 wikiPageWikiLink Q987652.
- Q5141281 comment "In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K1 and is closed under complementation and disjoint union.Cographs have been discovered independently by several authors since the 1970s; early references include Jung (1978), Lerchs (1971), Seinsche (1974), and Sumner (1974).".
- Q5141281 label "Cograph".
- Q5141281 depiction Turan_13-4.svg.