Hamiltonian cycle containg selected sets of edges of a graph

• Autorzy: Gancarzewicz G.
• Języki publikacji: EN

Abstrakty

EN

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

• Wydawca: -
• Czasopismo: World Scientific News
• Rocznik: 2016
• Tom: 57 Special Volume
• Opis fizyczny: p.404-415,fig.,ref.

Twórcy

autor

Gancarzewicz G.

• Institute of Mathematics, Tadeusz Kosciuszko Krakow University of Technology, 24 Warszawska Str., 31-155 Krakow, Poland

Bibliografia

• [1] J. A. Bondy and V. Chvátal, A method in graph theory, Discrete Math.15(1976) 111-135.
• [2] J.A. Bondy and U.S.R. Murty, Graph theory with applications, MacMillan Press LTD, 1976.
• [3] G. Fan, New sufficient conditions for cycles in graphs, J. Combin. Theory Ser. B37 (1984) 221-227.
• [4] G. Gancarzewicz and A.P. Wojda, Graphs with every k-matching in ahamiltonian cycle, Discrete Math.213(1-3)(2000)141-151.
• [5] H.V. Kronk, Variations of atheorem of pósa, in The Many Facets of Graph Theory, ed.G. Chartrand and S.F. Kapoor, Lect. Notes Math. 110 (1969) 193-197.
• [6] O. Ore, Note on hamiltonian circuits, Amer. Math. Monthly67(1960)55
• [7] Z. Skupień and A.P. Wojda, On highly hamiltonian graphs, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys.22(1974) 463-471.
• [8] M. Las Vargnas, Sur une propriété des arbres maximaux dans un graphe,C. R. Axad. Sci. Paris, Sér.A 272(1971)1297-1300.
• [9] A.P. Wojda, Hamiltonian cycles through matchings, Demonstratio MathematicaXXI(2)(1983) 547-553

Uwagi

EN

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