The existence of a path with two blocks in digraphs

DOI10.1007/S00373-024-02759-8MaRDI QIDQ6121919zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

chromatic numberfinal forestmaximal forestpath with two blocks

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Paths with two blocks in \(n\)-chromatic digraphs
• Paths with two blocks in k-chromatic digraphs
• Existence of paths with t blocks in k ( t )-chromatic digraph
• About paths with two blocks
• scientific article; zbMATH DE number 7560305

Cites work

• About paths with two blocks
• Diconnected Orientations and a Conjecture of Las Vergnas
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• Nombre chromatique et plus longs chemins d'un graphe
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths and Cycles in Tournaments
• Paths with two blocks in k-chromatic digraphs
• Paths with two blocks in \(n\)-chromatic digraphs

Cited in

(3)

• Existence of paths with t blocks in k ( t )-chromatic digraph
• Oriented Hamiltonian paths in digraphs with arbitrary chromatic number
• On paths with three blocks of the form P(1, k, 1) in digraphs

This page was built for publication: The existence of a path with two blocks in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121919)