Skip to main content
Log in

The Existence of a Path with Two Blocks in Digraphs

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

Abstract

We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any n-chromatic digraph D, with \(n\ge 4\), contains a path with two blocks of order n.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Addario-Berry, L., Havet, F., Thomasse, S.: Paths with two blocks in \(n\)-chromatic digraphs. J. Combin. Ser. B 97, 620–626 (2007)

    Article  MathSciNet  Google Scholar 

  2. Bondy, J.A.: Disconnected orientations and a conjecture of Las Vergnas. J. Lond. Math. Soc. (2) 14, 277–282 (1976)

    Article  Google Scholar 

  3. El Sahili, A.: Paths with two blocks in \(k\)-chromatic digraphs. Discrete Math. 287, 151–153 (2004)

    Article  MathSciNet  Google Scholar 

  4. El Sahili, A., Kouider, M.: About paths with two blocks. J. Graph Theory 55, 221–226 (2007)

    Article  MathSciNet  Google Scholar 

  5. Gallai, T.: On directed paths and circuits. In: Erdös , P., Katona, G. (Eds.) In Theory of Graphs, Academic press, New York, pp. 115–118 (1968)

  6. Havet, F., Thomassé, S.: Oriented hamiltonian paths in tournaments: a proof of Rosenfeld’s conjecture. J. Combin. Theory Ser B 78(2), 243–273 (2000)

    Article  MathSciNet  Google Scholar 

  7. Roy, B.: Nombre chromatique et plus longs chemins d’un graphe. Rev. Française Automat. Informat. Recherche Opérationelle Sér. Rouge 1, 127–132 (1967)

  8. Thomason, A.: Paths and cycles in tournaments. Trans. Am. Math. Soc. 296, 167–180 (1986)

    Article  MathSciNet  Google Scholar 

Download references

Funding

The authors declare that no funds, grants or other support were received during the preparation of this manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sara Nasser.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

El Sahili, A., Mortada, M. & Nasser, S. The Existence of a Path with Two Blocks in Digraphs. Graphs and Combinatorics 40, 34 (2024). https://doi.org/10.1007/s00373-024-02759-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-024-02759-8

Keywords

Mathematics Subject Classification

Navigation