article

Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor

Authors:

Hortensia Galeana-Sánchez,

Ilan A. GoldfederAuthors Info & Claims

Discrete Mathematics, Volume 315-316

Pages 135 - 143

https://doi.org/10.1016/j.disc.2013.10.019

Published: 01 February 2014 Publication History

Abstract

In 2004, Bang-Jensen introduced H"i-free digraphs, for i in {1,2,3,4}, as a generalization of semicomplete and semicomplete bipartite digraphs. Bang-Jensen conjectured that an H"i-free digraph D, for i in {1,2,3,4}, is Hamiltonian if and only if D is strong and contains a cycle factor (that is, a collection of vertex disjoint cycles covering all the vertices of D). S. Wang and R. Wang proved the conjecture for i in {1,2} in 2009 and Galeana-Sanchez, Goldfeder and Urrutia proved the conjecture for i=3 in 2010. In this paper, we prove the conjecture for i=4.

References

[1]

J. Bang-Jensen, Arc-local tournament digraphs: a generalization of tournaments and bipartite tournaments, Technical Report Preprint No. 10, Department of Mathematics and Computer Science, University of Southern Denmark, 1993.

Digital Library

Google Scholar

[2]

Bang-Jensen, J., The structure of strong arc-locally semicomplete digraphs. Discrete Math. v283. 1-6.

Google Scholar

[3]

J. Bang-Jensen, Locally semicomplete digraphs: a generalization.

Google Scholar

[4]

Bang-Jensen, J. and Gutin, G., . In: Monographs in Mathematics, Springer.

Google Scholar

[5]

Bang-Jensen, J., Gutin, G. and Huang, J., A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discrete Math. v161. 1-12.

Digital Library

Google Scholar

[6]

Galeana-Sánchez, H., Goldfeder, I.A. and Urrutia, I., On the structure of strong 3-quasi-transitive digraphs. Discrete Math. v310. 2495-2498.

Google Scholar

[7]

G. Gutin, On cycles in complete n-partite digraphs, Gomel Polytechnic Inst. 1982, Depon. in VINITI 17.05.82, No. 2473 (in Russian).

Google Scholar

[8]

Gutin, G., Criterion for complete bipartite digraphs to be Hamiltonian. Vestsı¿ Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk. v1. 109-110.

Google Scholar

[9]

Gutin, G., Effective characterization of complete bipartite digraphs that have a Hamiltonian path. Kibernetika (Kiev). v4. 124-125.

Google Scholar

[10]

Gutin, G., Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey. J. Graph Theory. v19 i4. 481-505.

Digital Library

Google Scholar

[11]

Häggkvist, R. and Manoussakis, Y., Cycles and paths in bipartite tournament with spanning configurations. Combinatorica. v9 i1. 33-38.

Google Scholar

[12]

Hungerford, T.W., Algebra. 2003. ed. Springer.

Google Scholar

[13]

Rotman, J.J., Advanced Modern Algebra. 2003. ed. Pretince Hall.

Google Scholar

[14]

Wang, S. and Wang, R., The structure of strong arc-locally semicomplete digraphs. Discrete Math. v309. 6555-6562.

Google Scholar

Cited By

View all

Wang R(2019)Critical Kernel Imperfect Problem in Generalizations of Bipartite TournamentsGraphs and Combinatorics10.1007/s00373-019-02022-535:3(669-675)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s00373-019-02022-5
Cordero-Michel NGaleana-Sánchez HGoldfeder I(2016)Some results on the existence of Hamiltonian cycles in the generalized sum of digraphsDiscrete Mathematics10.1016/j.disc.2016.02.009339:6(1763-1770)Online publication date: 6-Jun-2016
https://dl.acm.org/doi/10.1016/j.disc.2016.02.009

Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
    2. Graph theory
2. Theory of computation

Recommendations

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs

Let D 1 , , D k be a family of pairwise vertex-disjoint digraphs. The generalized sum of D 1 , , D k , denoted by D 1 D k , is the set of all digraphs D which satisfies: (i) V ( D ) = i = 1 k V ( D i ) , (ii) D V ( D i ) D i for every i k and (iii) ...
Quasi-Hamiltonian cycles in k -strong multipartite tournaments

A c -partite tournament is an orientation of a complete c -partite graph. Recently, M. Lu, et al., introduced the concept of quasi-Hamiltonian cycles, that is to say, cycles containing vertices from each partite set, in multipartite tournaments. W.D. ...
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
Abstract
We prove two sufficient conditions for Hamiltonian cycles in balanced bipartite digraphs. Let D be a strongly connected balanced bipartite digraph of order 2 a. Then:

(i) If a ≥ 4 and ...

Comments

Information & Contributors

Information

Published In

Discrete Mathematics Volume 315-316, Issue

February, 2014

184 pages

ISSN:0012-365X

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2014

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang R(2019)Critical Kernel Imperfect Problem in Generalizations of Bipartite TournamentsGraphs and Combinatorics10.1007/s00373-019-02022-535:3(669-675)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s00373-019-02022-5
Cordero-Michel NGaleana-Sánchez HGoldfeder I(2016)Some results on the existence of Hamiltonian cycles in the generalized sum of digraphsDiscrete Mathematics10.1016/j.disc.2016.02.009339:6(1763-1770)Online publication date: 6-Jun-2016
https://dl.acm.org/doi/10.1016/j.disc.2016.02.009

Abstract

References

Cited By

Recommendations

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs

Quasi-Hamiltonian cycles in k -strong multipartite tournaments

Sufficient conditions for Hamiltonian cycles in bipartite digraphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations