| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647458 | Discrete Mathematics | 2013 | 5 Pages |
Abstract
We give a short proof of the following strong version of Fleischner's theorem: if G is a2-connected graph and v1 and v2 are two distinct vertices of G, then G2 contains a Hamiltonian cycle C such that both edges of C incident with v1 and one further edge of C incident with v2 belong to G.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Janina Müttel, Dieter Rautenbach,