Hamiltonian cycle containg selected sets of edges of a graph / Grzegorz Gancarzewicz // World Scientific News [Dokument elektroniczny]. – 2016, Vol. 57, spec. vol., s. 404-415 : rys. – Tryb dostępu: ... więcej

Hamiltonian cycle containg selected sets of edges of a graph / Grzegorz Gancarzewicz // World Scientific News [Dokument elektroniczny]. – 2016, Vol. 57, spec. vol., s. 404-415 : rys. – Tryb dostępu: http://www.worldscientificnews.com/wp-content/uploads/2016/06/WSN-57-2016-404-415.pdf. – Bibliogr. 9 poz., Abstr. – Tyt. numeru: 1st International Scientific Conference, Dilemmas of Scientific Research in Various Fields of Science: natural sciences, science and technology, economic and social sciences, humanistic sciences, 10th October, 2016, Cracow, Poland. – ISSN 2392-2192

The aim of this paper is to characterize for every k ≥ 1 all (l + 3)-connected graphs G on n ≥ 3 vertices satisfying P(n + k): for each pair of vertices x and y in G, such that there is a path system ... więcej

The aim of this paper is to characterize for every k ≥ 1 all (l + 3)-connected graphs G on n ≥ 3 vertices satisfying P(n + k): for each pair of vertices x and y in G, such that there is a path system S of length k with l internal vertices which components are paths of length at most 2 satisfying: such that S is not contained in any hamiltonian cycle of G.