TY - JOUR
TI - CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH
AU - Gancarzewicz, Grzegorz
TI - CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH
AB - 
	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:
VL - 2014
IS - Nauki Podstawowe Zeszyt 2 NP (16) 2014
PY - 2015
SN - 0011-4561
C1 - 2353-737X
SP - 37
EP - 43
DO - 10.4467/2353737XCT.14.298.3386
UR - https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/cycles-containing-specified-edges-in-a-graph
KW - cycle
KW - graph
KW - hamiltonian cycle
KW - hamiltonian path
KW - matching
KW - path