Title of article
A short proof of the versatile version of Fleischner’s theorem
Author/Authors
Stephan and Müttel، نويسنده , , Janina and Rautenbach، نويسنده , , Dieter، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
5
From page
1929
To page
1933
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 v 2 are two distinct vertices of G , then G 2 contains a Hamiltonian cycle C such that both edges of C incident with v 1 and one further edge of C incident with v 2 belong to G .
Keywords
square of a graph , Fleischner’s theorem , hamiltonian cycle
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600414
Link To Document