@article{06926279-26dd-4041-8b47-e599e2dfebad,
author = {Grzegorz  Gancarzewicz},
title = {CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH},
journal = {Czasopismo Techniczne},
volume = {2014},
number = {Nauki Podstawowe Zeszyt 2 NP (16) 2014},
year = {2015},
issn = {0011-4561},
pages = {37-43},keywords = {cycle; graph; hamiltonian cycle; hamiltonian path; matching; path},
abstract = {The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfying
	2 > (4n - 4s - 3) / 3 ; then every matching of G lies on a cycle of length at least n-s and hence, in a path of length at least n - s + 1:},
doi = {10.4467/2353737XCT.14.298.3386},
url = {https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/cycles-containing-specified-edges-in-a-graph}
}