Paths with two blocks in \(k\)-chromatic digraphs

DOI10.1016/j.disc.2004.03.013zbMath1050.05072OpenAlexW2003732634MaRDI QIDQ1886358

Amine El Sahili

Publication date: 18 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.013

zbMATH Keywords

ColoringPathsDigraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Antidirected paths in 5-chromatic digraphs ⋮ A Ramsey type result for oriented trees ⋮ Paths with two blocks in \(n\)-chromatic digraphs ⋮ The existence of a path with two blocks in digraphs ⋮ Trees in tournaments ⋮ Directed Ramsey number for trees ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths and Cycles in Tournaments
• Functions and line digraphs
• Nombre chromatique et plus longs chemins d'un graphe
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paths with two blocks in \(k\)-chromatic digraphs