Skip to main content
SpringerLink
Log in

A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove that a strongly connected balanced bipartite digraph D of order 2a, \(a\ge 3\), satisfying \(d(u)+d(v)\ge 3a\) for every pair of vertices u, v with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length 2a.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adamus, J.: A degree sum condition for hamiltonicity in balanced bipartite digraphs. Graphs Combin. 33, 43–51 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  2. Adamus, J., Adamus, L., Yeo, A.: On the Meyniel condition for hamiltonicity in bipartite digraphs. Discrete Math. Theor. Comput. Sci. 16, 293–302 (2014)

    MathSciNet  MATH  Google Scholar 

  3. Bang-Jensen, J., Guo, Y., Yeo, A.: A new sufficient condition for a digraph to be Hamiltonian. Discrete Appl. Math. 95, 61–72 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)

    Book  MATH  Google Scholar 

  5. Bang-Jensen, J., Gutin, G., Li, H.: Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory 22, 181–187 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Darbinyan, S., Karapetyan, I.: A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs. arXiv:1706.00233v1 (electronic preprint)

  7. Thomassen, C.: An Ore-type condition implying a digraph to be pancyclic. Discr. Math. 19, 85–92 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang, R.: A sufficient condition for a balanced bipartite digraph to be Hamiltonian. Discrete Math. Theor. Comput. Sci. 19(3), 12 (2017) (Paper No. 11)

Download references

Acknowledgements

The author is grateful to an anonymous referee for spotting a critical mistake in an earlier version of the manuscript.

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Western Ontario, London, ON, N6A 5B7, Canada

    Janusz Adamus

Authors
  1. Janusz Adamus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Janusz Adamus.

Additional information

The research was partially supported by Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adamus, J. A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs. Graphs and Combinatorics 34, 703–709 (2018). https://doi.org/10.1007/s00373-018-1907-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-018-1907-7

Keywords

Mathematics Subject Classification

Search

Navigation