About: Even-hole-free graph

An Entity of Type: SocialGroup107950920, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. demonstrated that every even-hole-free graph contains a , which settled a conjecture by Reed.

Property Value
dbo:abstract
  • In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. demonstrated that every even-hole-free graph contains a , which settled a conjecture by Reed. (en)
  • En théorie des graphes, un graphe est sans trou pair s'il ne contient pas de cycle induit avec un nombre pair de sommets. (fr)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 17948663 (xsd:integer)
dbo:wikiPageLength
  • 6257 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1117784045 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. demonstrated that every even-hole-free graph contains a , which settled a conjecture by Reed. (en)
  • En théorie des graphes, un graphe est sans trou pair s'il ne contient pas de cycle induit avec un nombre pair de sommets. (fr)
rdfs:label
  • Even-hole-free graph (en)
  • Graphe sans trou pair (fr)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink 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 3.0 Unported License