The existence of a path with two blocks in digraphs
From MaRDI portal
Publication:6121919
DOI10.1007/s00373-024-02759-8OpenAlexW4392678893MaRDI QIDQ6121919
Amine El Sahili, Maidoun Mortada, Sara Nasser
Publication date: 26 March 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-024-02759-8
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Paths with two blocks in \(n\)-chromatic digraphs
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Paths with two blocks in \(k\)-chromatic digraphs
- Paths and Cycles in Tournaments
- Diconnected Orientations and a Conjecture of Las Vergnas
- About paths with two blocks
- Nombre chromatique et plus longs chemins d'un graphe
This page was built for publication: The existence of a path with two blocks in digraphs