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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2018
0120032018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Fleischner’s theorem says that the square of every 2connected graph contains a Hamiltonian cycle. We present a proof resulting in… (More)
  • figure 1
Is this relevant?
2013
2013
We give a short proof of the following strong version of Fleischner’s theorem: if G is a 2-connected graph and v1 and v2 are two… (More)
Is this relevant?
2009
2009
We give a short proof of the fact that the square of a 2-connected finite graph is Hamiltonian. 
  • figure 1
  • figure 2
Is this relevant?
2003
2003
The complexity of the field of mathematics makes the study of any associated learning disability daunting. In theory, a… (More)
  • table 12.1
  • table 12.2
Is this relevant?