Cyclability in bipartite graphs

• Autorzy: Amar D. , Flandrin E. , Gancarzewicz G.
• Języki publikacji: EN

Abstrakty

EN

Let G = (X, Y; E) be a balanced 2-connected bipartite graph and S ⊂ V(G). We will say that S is cyclable in G if all vertices of S belong to a common cycle in G. We give sufficient degree conditions in a balanced bipartite graph G and a subset S ⊂ V(G) for the cyclability of the set S.

Słowa kluczowe

EN

graphs; cycles; bipartite graphs

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2009
• Tom: Vol. 29, no. 4
• Strony: 345--364
• Opis fizyczny: Bibliogr. 9 poz., rys.

Twórcy

autor

Amar D.

autor

Flandrin E.

autor

Gancarzewicz G.

• AGH University of Science and Technology Faculty of Applied Mathematics al. Mickiewicza 30, 30-059 Cracow, Poland [Gancarzewicz, G.],

Bibliografia

• [1] J.A. Bondy, V. Chvátal, A method in graph theory, DiscreteMath. 15 (1976), 111–135.
• [2] D. Amar, M. El Kadi Abderrezzak, E. Flandrin, Cyclability and pancyclability in bipartite graphs, Discrete Math. 236 (2001), 3–11.
• [3] R. Čada, E. Flandrin, H. Li, Z. Ryjáček, Cycles trough given vertices and closures, Discrete Mathematics 276 (2004), 65–70.
• [4] E. Flandrin, H. Li, A. Marczyk, M. Woźniak, A note on a generalization of Ore’s condition, Rapport de Recherche LRI (2002).
• [5] J. Moon, M. Moser, On hamiltonian bipartite graphs, Israel J. Math. 1 (1963), 357–369.
• [6] O. Ore, Note on hamiltonian circuits, Amer. Math. Monthly 67 (1960) 55.
• [7] K. Ota, Cycles through prescribed vertices with large degree sum, Discrete Mathematics 145 (1995), 201–210.
• [8] Shi Ronghua, 2-neighborhoods and hamiltonian conditions, J. Graph Theory 16 (1992), 267–271.
• [9] M.E. Watkins, D.M. Mesner, Cycles and connectivity in graphs, Canad. J. Math. 19 (1967), 1319–1328.