Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
For a graph $G$, the $t$-th power $G^t$ is the graph on $V(G)$ such that two vertices are adjacent if and only if they have… Expand
2018
2018
Fleischner's theorem says that the square of every 2-connected graph contains a Hamiltonian cycle. We present a proof resulting… Expand
  • figure 1
2013
2013
Abstract We give a short proof of the following strong version of Fleischner’s theorem: if G is a 2 -connected graph and v 1 and… Expand
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
2005
2005
ConclusionsA psychosomatic study ofmaladie des tics, or Gilles de la Tourette's disease is presented, with a detailed analysis of… Expand
2005
2005
Difficulties with college algebra can be the gatekeeper for earning a degree. Students struggle with algebra for many reasons… Expand
  • table 1
  • table 2
2005
2005
Kranken hingewiesen zu haben. WESTPHAL und KATSCH bes t~t igten diese Beobachtung , und YON BERGMANN pr~tzisierte sie. Viele… Expand
Highly Cited
2003
Highly Cited
2003
The complexity of the field of mathematics makes the study of any associated learning disability daunting. In theory, a… Expand
  • table 12.1
  • table 12.2