Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Barnette's_conjecture> ?p ?o. }
Showing items 1 to 48 of
48
with 100 items per page.
- Barnette's_conjecture abstract "Barnette's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning Hamiltonian cycles in graphs. It is named after David W. Barnette, 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.".
- Barnette's_conjecture wikiPageExternalLink barnettes_conjecture.
- Barnette's_conjecture wikiPageExternalLink 98.pdf.
- Barnette's_conjecture wikiPageExternalLink StrengtheningBarnette'sConjecture10.pdf.
- Barnette's_conjecture wikiPageID "28059825".
- Barnette's_conjecture wikiPageRevisionID "583482012".
- Barnette's_conjecture authorlink "P. G. Tait".
- Barnette's_conjecture authorlink "W. T. Tutte".
- Barnette's_conjecture first "P. G.".
- Barnette's_conjecture first "W. T.".
- Barnette's_conjecture hasPhotoCollection Barnette's_conjecture.
- Barnette's_conjecture last "Tait".
- Barnette's_conjecture last "Tutte".
- Barnette's_conjecture title "Barnette's Conjecture".
- Barnette's_conjecture urlname "BarnettesConjecture".
- Barnette's_conjecture year "1884".
- Barnette's_conjecture year "1946".
- Barnette's_conjecture subject Category:Conjectures.
- Barnette's_conjecture subject Category:Hamiltonian_paths_and_cycles.
- Barnette's_conjecture subject Category:Planar_graphs.
- Barnette's_conjecture type Abstraction100002137.
- Barnette's_conjecture type Act100030358.
- Barnette's_conjecture type Action100037396.
- Barnette's_conjecture type Cognition100023271.
- Barnette's_conjecture type Communication100033020.
- Barnette's_conjecture type Concept105835747.
- Barnette's_conjecture type Conjectures.
- Barnette's_conjecture type Content105809192.
- Barnette's_conjecture type Course100038262.
- Barnette's_conjecture type Event100029378.
- Barnette's_conjecture type Graph107000195.
- Barnette's_conjecture type HamiltonianPathsAndCycles.
- Barnette's_conjecture type Hypothesis105888929.
- Barnette's_conjecture type Idea105833840.
- Barnette's_conjecture type PlanarGraphs.
- Barnette's_conjecture type PsychologicalFeature100023100.
- Barnette's_conjecture type Speculation105891783.
- Barnette's_conjecture type VisualCommunication106873252.
- Barnette's_conjecture type Way100415676.
- Barnette's_conjecture type YagoPermanentlyLocatedEntity.
- Barnette's_conjecture comment "Barnette's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning Hamiltonian cycles in graphs. It is named after David W. Barnette, 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.".
- Barnette's_conjecture label "Barnette's conjecture".
- Barnette's_conjecture sameAs m.0cm8nb8.
- Barnette's_conjecture sameAs Q4861653.
- Barnette's_conjecture sameAs Q4861653.
- Barnette's_conjecture sameAs Barnette's_conjecture.
- Barnette's_conjecture wasDerivedFrom Barnette's_conjecture?oldid=583482012.
- Barnette's_conjecture isPrimaryTopicOf Barnette's_conjecture.