About: Strong perfect graph theorem

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Perfect graphs have neither odd holes nor odd antiholes

Property Value
dbo:description
  • твердження в теорії графів про те, що досконалі графи не мають ні непарних дір, ні непарних антидір (uk)
  • perfect graphs have neither odd holes nor odd antiholes (en)
  • caractérisation des graphes parfaits (fr)
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:title
  • Strong Perfect Graph Theorem (en)
dbp:urlname
  • StrongPerfectGraphTheorem (en)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • Strong perfect graph theorem (en)
  • Théorème des graphes parfaits (fr)
  • Сильная гипотеза о совершенных графах (ru)
  • Сильна теорема про досконалі графи (uk)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International