Skip to main content
SpringerLink
Log in

Degree Condition for a Digraph to be Supereulerian

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

Abstract

A digraph D is supereulerian if D has a spanning eulerian subdigraph. We introduce some sufficient conditions for a digraph D to be supereulerian.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Algefari, M.J., Alsatami, K.A., Lai, H.-J., Liu, J.: Supereulerian digraphs with given local structures. Inform. Process. Lett 116, 321–326 (2016)

    Article  MathSciNet  Google Scholar 

  2. Algefari, M.J., Lai, H.-J.: Supereulerian digraphs with large arc-strong connectivity. J. Graph Theory 81, 393–402 (2016)

    Article  MathSciNet  Google Scholar 

  3. Algefari, M.J., Lai, H.-J., Xu, J.: Locally dense supereulerian digraphs. Discret. Appl. Math. 238, 24–31 (2018)

    Article  MathSciNet  Google Scholar 

  4. Alsatami, K.A., Zhang, X.D., Liu, J., Lai, H.-J.: On class of supereulerian digraphs. Appl. Math. 7, 320–326 (2016)

    Article  Google Scholar 

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

    Book  Google Scholar 

  6. Bang-Jensen, J., Maddaloni, A.: Sufficient conditions for a digraph to be supereulerian. J. Graph Theory 79(1), 8–20 (2015)

    Article  MathSciNet  Google Scholar 

  7. Boesch, F.T., Suffel, C., Tindell, R.: The spanning subgraphs of eulerian graphs. J. Graph Theory 1, 79–84 (1977)

    Article  MathSciNet  Google Scholar 

  8. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)

    Book  Google Scholar 

  9. Catlin, P.A.: Supereulerian graphs: a survey. J. Graph Theory 16, 177–196 (1992)

    Article  MathSciNet  Google Scholar 

  10. Chen, Z. H., Lai, H.-J.: Reduction techniques for super-Eulerian graphs and related topics-a survey, Combinatorics and graph theory’ 95, Vol. 1 (Hefei), World Sci. Publishing, River Edge, NJ 1995 pp. 53-69

  11. Chvátal, V., Erdős, P.: A note on Hamiltonian circuits. Discret. Math. 2, 111–113 (1972)

    Article  MathSciNet  Google Scholar 

  12. Gutin, G.: Cycles and paths in directed graphs. PhD thesis, School of Mathematics, Tel Aviv University (1993)

  13. Gutin, G.: Connected (g; f)-factors and supereulerian digraphs. Ars Combin. 54, 311–317 (2000)

    MathSciNet  MATH  Google Scholar 

  14. Lai, H.-J., Shao, Y., Yan, H.: An Update on Supereulerian Graphs. WSEAS Trans. Math. 12, 926–940 (2013)

    Google Scholar 

  15. Meyniel, H.: Une condition suffisante d’existence d’un circuit hamiltonien dans un graphe orienté. J. Combin. Theory Ser. B 14, 137–147 (1973)

    Article  MathSciNet  Google Scholar 

  16. Pulleyblank, W.R.: A note on graphs spanned by Eulerian graphs. J. Graph Theory 3, 309–310 (1979)

    Article  MathSciNet  Google Scholar 

  17. Thomassen, C.: Long cycles in digraphs. Proc. Lond. Math. Soc. (3), 42, 231-251 (1981)

  18. Zhao, L.-C., Meng, J.-H.: A sufficient condition for hamiltonian cycles in digraphs. Ars Combin. 32, 335–338 (1991)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management and Humanities Sciences, Community College, Qassim University, Buraydah, Kingdom of Saudi Arabia

    Mansour J. Algefari

Authors
  1. Mansour J. Algefari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mansour J. Algefari.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Algefari, M.J. Degree Condition for a Digraph to be Supereulerian. Graphs and Combinatorics 38, 9 (2022). https://doi.org/10.1007/s00373-021-02421-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-021-02421-7

Keywords

Search

Navigation