Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7168084> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Q7168084 subject Q7007192.
- Q7168084 subject Q7494515.
- Q7168084 subject Q8266681.
- Q7168084 abstract "In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph is also perfect. This result had been conjectured by Berge (1961, 1963), and it is sometimes called the weak perfect graph theorem to distinguish it from the strong perfect graph theorem characterizing perfect graphs by their forbidden induced subgraphs.".
- Q7168084 thumbnail 7-hole_and_antihole.svg?width=300.
- Q7168084 wikiPageWikiLink Q1060343.
- Q7168084 wikiPageWikiLink Q1065144.
- Q7168084 wikiPageWikiLink Q1096734.
- Q7168084 wikiPageWikiLink Q1134776.
- Q7168084 wikiPageWikiLink Q1187620.
- Q7168084 wikiPageWikiLink Q131476.
- Q7168084 wikiPageWikiLink Q1322892.
- Q7168084 wikiPageWikiLink Q141488.
- Q7168084 wikiPageWikiLink Q17156804.
- Q7168084 wikiPageWikiLink Q174733.
- Q7168084 wikiPageWikiLink Q3033506.
- Q7168084 wikiPageWikiLink Q3186905.
- Q7168084 wikiPageWikiLink Q3736652.
- Q7168084 wikiPageWikiLink Q431937.
- Q7168084 wikiPageWikiLink Q45715.
- Q7168084 wikiPageWikiLink Q474715.
- Q7168084 wikiPageWikiLink Q504843.
- Q7168084 wikiPageWikiLink Q5155607.
- Q7168084 wikiPageWikiLink Q5282038.
- Q7168084 wikiPageWikiLink Q5467387.
- Q7168084 wikiPageWikiLink Q564426.
- Q7168084 wikiPageWikiLink Q622506.
- Q7168084 wikiPageWikiLink Q6786839.
- Q7168084 wikiPageWikiLink Q6874717.
- Q7168084 wikiPageWikiLink Q7007192.
- Q7168084 wikiPageWikiLink Q7494515.
- Q7168084 wikiPageWikiLink Q761631.
- Q7168084 wikiPageWikiLink Q7840044.
- Q7168084 wikiPageWikiLink Q8266681.
- Q7168084 wikiPageWikiLink Q897769.
- Q7168084 wikiPageWikiLink Q902252.
- Q7168084 comment "In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph is also perfect. This result had been conjectured by Berge (1961, 1963), and it is sometimes called the weak perfect graph theorem to distinguish it from the strong perfect graph theorem characterizing perfect graphs by their forbidden induced subgraphs.".
- Q7168084 label "Perfect graph theorem".
- Q7168084 depiction 7-hole_and_antihole.svg.