Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Fleischners_theorem> ?p ?o }
Showing triples 1 to 49 of
49
with 100 triples per page.
- Fleischners_theorem abstract "In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if G is a 2-vertex-connected graph, then the square of G is Hamiltonian. it is named after Herbert Fleischner, who published its proof in 1974.".
- Fleischners_theorem thumbnail Fleischners_theorem.svg?width=300.
- Fleischners_theorem wikiPageExternalLink Ch10.pdf.
- Fleischners_theorem wikiPageExternalLink books?id=K6-FvXRlKsQC&pg=PA139.
- Fleischners_theorem wikiPageID "38602621".
- Fleischners_theorem wikiPageLength "10741".
- Fleischners_theorem wikiPageOutDegree "33".
- Fleischners_theorem wikiPageRevisionID "683470840".
- Fleischners_theorem wikiPageWikiLink Carsten_Thomassen.
- Fleischners_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Fleischners_theorem wikiPageWikiLink Compact_space.
- Fleischners_theorem wikiPageWikiLink Complete_bipartite_graph.
- Fleischners_theorem wikiPageWikiLink Conjecture.
- Fleischners_theorem wikiPageWikiLink Crispin_Nash-Williams.
- Fleischners_theorem wikiPageWikiLink Cycle_(graph_theory).
- Fleischners_theorem wikiPageWikiLink Cyclic_order.
- Fleischners_theorem wikiPageWikiLink Discrete_Mathematics_(journal).
- Fleischners_theorem wikiPageWikiLink End_(graph_theory).
- Fleischners_theorem wikiPageWikiLink Graph_(discrete_mathematics).
- Fleischners_theorem wikiPageWikiLink Graph_power.
- Fleischners_theorem wikiPageWikiLink Graph_theory.
- Fleischners_theorem wikiPageWikiLink Graph_toughness.
- Fleischners_theorem wikiPageWikiLink Hamiltonian_path.
- Fleischners_theorem wikiPageWikiLink Homeomorphism.
- Fleischners_theorem wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Fleischners_theorem wikiPageWikiLink K-vertex-connected_graph.
- Fleischners_theorem wikiPageWikiLink L._W._Beineke.
- Fleischners_theorem wikiPageWikiLink Michael_D._Plummer.
- Fleischners_theorem wikiPageWikiLink NP-completeness.
- Fleischners_theorem wikiPageWikiLink Pancyclic_graph.
- Fleischners_theorem wikiPageWikiLink Petersen_graph.
- Fleischners_theorem wikiPageWikiLink Simplicial_complex.
- Fleischners_theorem wikiPageWikiLink Václav_Chvátal.
- Fleischners_theorem wikiPageWikiLink File:Fleischners_theorem.svg.
- Fleischners_theorem wikiPageWikiLinkText "Fleischner's theorem".
- Fleischners_theorem wikiPageUsesTemplate Template:Citation.
- Fleischners_theorem wikiPageUsesTemplate Template:Harvtxt.
- Fleischners_theorem wikiPageUsesTemplate Template:Reflist.
- Fleischners_theorem wikiPageUsesTemplate Template:Sfnp.
- Fleischners_theorem subject Category:Theorems_in_graph_theory.
- Fleischners_theorem type Theorem.
- Fleischners_theorem comment "In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if G is a 2-vertex-connected graph, then the square of G is Hamiltonian. it is named after Herbert Fleischner, who published its proof in 1974.".
- Fleischners_theorem label "Fleischner's theorem".
- Fleischners_theorem sameAs Q5458529.
- Fleischners_theorem sameAs m.0r4t32b.
- Fleischners_theorem sameAs Q5458529.
- Fleischners_theorem wasDerivedFrom Fleischners_theorem?oldid=683470840.
- Fleischners_theorem depiction Fleischners_theorem.svg.
- Fleischners_theorem isPrimaryTopicOf Fleischners_theorem.