Lesson plan

Fleischner's theorem

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 biconnected graph, then the square of G is Hamiltonian. It is named after Herbert Fleischner, who published its proof in 1974.

Back to article

Article summary

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 biconnected graph, then the square of G is Hamiltonian. It is named after Herbert Fleischner, who published its proof in 1974.

Key claims

  1. publication date: 1974 — source: Wikipedia, revision 1370011385, retrieved 2026-10-20 · confidence 0.95
  2. publication date: 1974 — source: Wikipedia, revision 1370011385, retrieved 2026-10-20 · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "1974". What evidence would count against this claim?
  3. The record states that the publication date is "1974". What evidence would count against this claim?
  4. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  5. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia, “Fleischner's theorem”, revision 1370011385, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1370011385

Key claims and bibliography are generated from the same tracked claims and sources as the article page.