• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Barnette's conjecture     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatPlanarGraphs, within Data Space : dbpedia.org associated with source document(s)

Type: yago:WikicatConjecturesyago:Abstraction100002137yago:Act100030358yago:Action100037396yago:Cognition100023271yago:Communication100033020yago:Concept105835747yago:Content105809192yago:Course100038262yago:Event100029378yago:Graph107000195yago:Hypothesis105888929yago:Idea105833840yago:PsychologicalFeature100023100yago:WikicatHamiltonianPathsAndCyclesyago:YagoPermanentlyLocatedEntitydiseaseyago:Speculation105891783yago:VisualCommunication106873252yago:Way100415676yago:WikicatPlanarGraphs New Facet based on Instances of this Class

Barnette's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning Hamiltonian cycles in graphs. It is named after , a professor emeritus at the University of California, Davis; it states that every bipartite polyhedral graph with three edges per vertex has a Hamiltonian cycle.