Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Grinbergs_theorem> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Grinbergs_theorem abstract "In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengths of its face cycles. The result has been widely used to construct non-Hamiltonian planar graphs with further properties, such as to give new counterexamples to Tait's conjecture (originally disproved by W.T. Tutte in 1946). This theorem was proved by Latvian mathematician Emanuel Grinberg in 1968.".
- Grinbergs_theorem thumbnail Grinberg_5CEC_Nonhamiltonian_graph.svg?width=300.
- Grinbergs_theorem wikiPageExternalLink eulers-formulaII.html.
- Grinbergs_theorem wikiPageExternalLink GrinbergGraphs.html.
- Grinbergs_theorem wikiPageID "22816079".
- Grinbergs_theorem wikiPageLength "6951".
- Grinbergs_theorem wikiPageOutDegree "26".
- Grinbergs_theorem wikiPageRevisionID "637940201".
- Grinbergs_theorem wikiPageWikiLink American_Mathematical_Society.
- Grinbergs_theorem wikiPageWikiLink Barnettes_conjecture.
- Grinbergs_theorem wikiPageWikiLink Bipartite_graph.
- Grinbergs_theorem wikiPageWikiLink Category:Hamiltonian_paths_and_cycles.
- Grinbergs_theorem wikiPageWikiLink Category:Planar_graphs.
- Grinbergs_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Grinbergs_theorem wikiPageWikiLink Counterexample.
- Grinbergs_theorem wikiPageWikiLink Cubic_graph.
- Grinbergs_theorem wikiPageWikiLink Discrete_Mathematics_(journal).
- Grinbergs_theorem wikiPageWikiLink Emanuel_Grinberg.
- Grinbergs_theorem wikiPageWikiLink Emanuels_Grīnbergs.
- Grinbergs_theorem wikiPageWikiLink Euler_characteristic.
- Grinbergs_theorem wikiPageWikiLink Graph_theory.
- Grinbergs_theorem wikiPageWikiLink Hamiltonian_cycle.
- Grinbergs_theorem wikiPageWikiLink Hamiltonian_path.
- Grinbergs_theorem wikiPageWikiLink Hypohamiltonian_graph.
- Grinbergs_theorem wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Grinbergs_theorem wikiPageWikiLink Latvia.
- Grinbergs_theorem wikiPageWikiLink MathWorld.
- Grinbergs_theorem wikiPageWikiLink Planar_graph.
- Grinbergs_theorem wikiPageWikiLink Polyhedral_graph.
- Grinbergs_theorem wikiPageWikiLink Taits_conjecture.
- Grinbergs_theorem wikiPageWikiLink Tutte_graph.
- Grinbergs_theorem wikiPageWikiLink W.T._Tutte.
- Grinbergs_theorem wikiPageWikiLink W._T._Tutte.
- Grinbergs_theorem wikiPageWikiLink File:Grinberg_5CEC_Nonhamiltonian_graph.svg.
- Grinbergs_theorem wikiPageWikiLinkText "Grinberg's theorem".
- Grinbergs_theorem hasPhotoCollection Grinbergs_theorem.
- Grinbergs_theorem wikiPageUsesTemplate Template:Arxiv.
- Grinbergs_theorem wikiPageUsesTemplate Template:Citation.
- Grinbergs_theorem wikiPageUsesTemplate Template:Harv.
- Grinbergs_theorem wikiPageUsesTemplate Template:Harvnb.
- Grinbergs_theorem wikiPageUsesTemplate Template:Harvtxt.
- Grinbergs_theorem subject Category:Hamiltonian_paths_and_cycles.
- Grinbergs_theorem subject Category:Planar_graphs.
- Grinbergs_theorem subject Category:Theorems_in_graph_theory.
- Grinbergs_theorem hypernym Condition.
- Grinbergs_theorem type Disease.
- Grinbergs_theorem comment "In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengths of its face cycles. The result has been widely used to construct non-Hamiltonian planar graphs with further properties, such as to give new counterexamples to Tait's conjecture (originally disproved by W.T. Tutte in 1946). This theorem was proved by Latvian mathematician Emanuel Grinberg in 1968.".
- Grinbergs_theorem label "Grinberg's theorem".
- Grinbergs_theorem sameAs m.063z3hc.
- Grinbergs_theorem sameAs Q5609384.
- Grinbergs_theorem sameAs Q5609384.
- Grinbergs_theorem wasDerivedFrom Grinbergs_theoremoldid=637940201.
- Grinbergs_theorem depiction Grinberg_5CEC_Nonhamiltonian_graph.svg.
- Grinbergs_theorem isPrimaryTopicOf Grinbergs_theorem.