Ore and Erdős type conditions for long cycles in balanced bipartite graphs - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2009

Ore and Erdős type conditions for long cycles in balanced bipartite graphs

Résumé

We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a long cycle C(2n-2k), where 0 <= k < n/2. For k = 0, these are the classical hamiltonicity criteria of Moon and Moser. The main two results of the paper assert that our conjectures hold for k = 1 as well.
Fichier principal
Vignette du fichier
1290-4370-1-PB.pdf (154.1 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00988209 , version 1 (07-05-2014)

Identifiants

Citer

Janusz Adamus, Lech Adamus. Ore and Erdős type conditions for long cycles in balanced bipartite graphs. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 2 (2), pp.57--69. ⟨10.46298/dmtcs.459⟩. ⟨hal-00988209⟩
135 Consultations
1307 Téléchargements

Altmetric

Partager

More