%0 Journal Article
%T CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH
%A Gancarzewicz, Grzegorz
%J Czasopismo Techniczne
%V 2014
%R 10.4467/2353737XCT.14.298.3386
%N Nauki Podstawowe Zeszyt 2 NP (16) 2014
%P 37-43
%K cycle, graph, hamiltonian cycle, hamiltonian path, matching, path
%@ 0011-4561
%D 2015
%U https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/cycles-containing-specified-edges-in-a-graph
%X 
	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: