About: Hypohamiltonian graph

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

Graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian

thumbnail
Property Value
dbo:description
  • olyan gráf, mely nem rendelkezik Hamilton-körrel, de tetszőleges csúcsát eltávolítva már lesz benne Hamilton-kör (hu)
  • если сам по себе граф не имеет гамильтонова цикла, но любой граф, полученный удалением одной вершины из G, является гамильтоновым (ru)
  • graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:mode
  • cs2 (en)
dbp:title
  • Hypohamiltonian Graph (en)
dbp:urlname
  • HypohamiltonianGraph (en)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:label
  • Hypohamiltonian graph (en)
  • Hypohamiltonscher Graph (de)
  • Graphe hypohamiltonien (fr)
  • Гипогамильтонов граф (ru)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is dbp:properties 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