Fleischner's theorem (original) (raw)

About DBpedia

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.

thumbnail

Property Value
dbo: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. (en) En théorie des graphes, le théorème de Fleischner donne une condition suffisante pour qu'un graphe contienne un cycle hamiltonien. Il dit que le (en) d'un graphe biconnexe est un graphe hamiltonien. Le théorème porte le nom de Herbert Fleischner, qui en a publié la preuve en 1974. (fr) Теорема Фляйшнера — утверждение в теории графов, дающее достаточное условие, чтобы граф содержал гамильтонов цикл: если граф является вершинно 2-связным графом, то квадрат графа гамильтонов. Названа именем , опубликовавшего доказательство теоремы в 1974 году. (ru)
dbo:thumbnail wiki-commons:Special:FilePath/Fleischner's_theorem.svg?width=300
dbo:wikiPageExternalLink https://archive.org/details/advancesingrapht0000camb/page/269 https://research.utwente.nl/en/publications/not-every-2tough-graph-is-hamiltonian(8189db8b-1470-4c06-b5a2-19d621bfc91b).html http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/preview/Ch10.pdf https://books.google.com/books%3Fid=K6-FvXRlKsQC&pg=PA139 https://www.researchgate.net/publication/220430962
dbo:wikiPageID 38602621 (xsd:integer)
dbo:wikiPageLength 13747 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID 1096469476 (xsd:integer)
dbo:wikiPageWikiLink dbr:End_(graph_theory) dbr:Michael_D._Plummer dbr:Approximation_algorithm dbr:Cycle_(graph_theory) dbr:Undirected_graph dbr:L._W._Beineke dbr:Compact_space dbr:Complete_bipartite_graph dbr:Crispin_Nash-Williams dbr:Petersen_graph dbr:Graph_(discrete_mathematics) dbr:Bottleneck_traveling_salesman_problem dbr:NP-complete dbr:Conjecture dbr:Václav_Chvátal dbr:K-vertex-connected_graph dbr:Cyclic_order dbr:Discrete_Mathematics_(journal) dbr:Graph_theory dbr:Graph_toughness dbr:Journal_of_Combinatorial_Theory dbr:Simplicial_complex dbc:Theorems_in_graph_theory dbr:Hamiltonian_path dbr:Advances_in_Mathematics dbr:Herbert_Fleischner dbr:Homeomorphism dbr:Metric_space dbr:Carsten_Thomassen dbr:Pancyclic_graph dbr:Hamiltonian_cycle dbr:Power_of_graph dbr:File:Fleischner's_theorem.svg
dbp:wikiPageUsesTemplate dbt:Citation dbt:Harvtxt dbt:Mvar dbt:Reflist dbt:Sfnp dbt:Short_description
dcterms:subject dbc:Theorems_in_graph_theory
rdf:type yago:WikicatTheoremsInGraphTheory yago:Abstraction100002137 yago:Communication100033020 yago:Message106598915 yago:Proposition106750804 yago:Statement106722453 yago:Theorem106752293
rdfs: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. (en) En théorie des graphes, le théorème de Fleischner donne une condition suffisante pour qu'un graphe contienne un cycle hamiltonien. Il dit que le (en) d'un graphe biconnexe est un graphe hamiltonien. Le théorème porte le nom de Herbert Fleischner, qui en a publié la preuve en 1974. (fr) Теорема Фляйшнера — утверждение в теории графов, дающее достаточное условие, чтобы граф содержал гамильтонов цикл: если граф является вершинно 2-связным графом, то квадрат графа гамильтонов. Названа именем , опубликовавшего доказательство теоремы в 1974 году. (ru)
rdfs:label Fleischner's theorem (en) Théorème de Fleischner (fr) Теорема Фляйшнера (ru) Теорема Фляйшнера (uk)
owl:sameAs freebase:Fleischner's theorem yago-res:Fleischner's theorem wikidata:Fleischner's theorem dbpedia-fr:Fleischner's theorem dbpedia-hu:Fleischner's theorem dbpedia-ru:Fleischner's theorem dbpedia-uk:Fleischner's theorem https://global.dbpedia.org/id/4jh8N
prov:wasDerivedFrom wikipedia-en:Fleischner's_theorem?oldid=1096469476&ns=0
foaf:depiction wiki-commons:Special:FilePath/Fleischner's_theorem.svg
foaf:isPrimaryTopicOf wikipedia-en:Fleischner's_theorem
is dbo:wikiPageWikiLink of dbr:Michael_D._Plummer dbr:Graph_power dbr:Bottleneck_traveling_salesman_problem dbr:Paris_Underground dbr:Graph_toughness dbr:Hamiltonian_path dbr:Herbert_Fleischner dbr:Pancyclic_graph
is foaf:primaryTopic of wikipedia-en:Fleischner's_theorem