CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH

• Authors: GRZEGORZ GANCARZEWICZ
• Languages of publication: PL

Abstracts

PL

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:

Keywords

PL

cycle, graph, hamiltonian cycle, hamiltonian path, matching, path

• Publisher: [unknown2]
• Journal: Czasopismo Techniczne
• Year: -

Dates

online

2015-04-09

Contributors

author

GRZEGORZ GANCARZEWICZ